./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-38.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '1fe81127d69b7276d52c9dc992cdfd5ba3c95fcd5376dc8c91bd7ac959faa3c0'] 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_floatingpointinfluence_has-floats_file-38.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1fe81127d69b7276d52c9dc992cdfd5ba3c95fcd5376dc8c91bd7ac959faa3c0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:37:01,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:37:01,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 07:37:01,113 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:37:01,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:37:01,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:37:01,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:37:01,138 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:37:01,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:37:01,139 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:37:01,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:37:01,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:37:01,139 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:37:01,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:37:01,141 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:37:01,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:37:01,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:37:01,141 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:37:01,141 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 07:37:01,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:37:01,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:37:01,141 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:37:01,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:37:01,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:37:01,142 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:37:01,142 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:37:01,142 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:37:01,142 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:37:01,143 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:37:01,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:37:01,143 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:37:01,143 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:37:01,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:37:01,143 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:37:01,143 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:37:01,143 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:37:01,143 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 07:37:01,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 07:37:01,143 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:37:01,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:37:01,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:37:01,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:37:01,143 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 -> 1fe81127d69b7276d52c9dc992cdfd5ba3c95fcd5376dc8c91bd7ac959faa3c0 [2024-11-07 07:37:01,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:37:01,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:37:01,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:37:01,448 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:37:01,448 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:37:01,449 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-38.i [2024-11-07 07:37:02,727 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:37:02,999 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:37:02,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-38.i [2024-11-07 07:37:03,009 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e28358041/a0d851c4083f4ba2a666918de5225e44/FLAG2ef252fd4 [2024-11-07 07:37:03,032 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e28358041/a0d851c4083f4ba2a666918de5225e44 [2024-11-07 07:37:03,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:37:03,038 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:37:03,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:37:03,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:37:03,044 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:37:03,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:37:03" (1/1) ... [2024-11-07 07:37:03,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a42598a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:03, skipping insertion in model container [2024-11-07 07:37:03,046 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:37:03" (1/1) ... [2024-11-07 07:37:03,065 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:37:03,195 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_floatingpointinfluence_has-floats_file-38.i[917,930] [2024-11-07 07:37:03,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:37:03,269 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:37:03,279 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_floatingpointinfluence_has-floats_file-38.i[917,930] [2024-11-07 07:37:03,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:37:03,333 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:37:03,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:03 WrapperNode [2024-11-07 07:37:03,334 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:37:03,335 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:37:03,335 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:37:03,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:37:03,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:03" (1/1) ... [2024-11-07 07:37:03,347 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:03" (1/1) ... [2024-11-07 07:37:03,380 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-11-07 07:37:03,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:37:03,381 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:37:03,381 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:37:03,381 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:37:03,392 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:03" (1/1) ... [2024-11-07 07:37:03,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:03" (1/1) ... [2024-11-07 07:37:03,395 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:03" (1/1) ... [2024-11-07 07:37:03,419 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 07:37:03,419 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:03" (1/1) ... [2024-11-07 07:37:03,419 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:03" (1/1) ... [2024-11-07 07:37:03,425 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:03" (1/1) ... [2024-11-07 07:37:03,428 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:03" (1/1) ... [2024-11-07 07:37:03,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:03" (1/1) ... [2024-11-07 07:37:03,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:03" (1/1) ... [2024-11-07 07:37:03,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:37:03,434 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:37:03,435 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:37:03,435 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:37:03,436 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:03" (1/1) ... [2024-11-07 07:37:03,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:37:03,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:37:03,469 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 07:37:03,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 07:37:03,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:37:03,494 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:37:03,495 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:37:03,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 07:37:03,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:37:03,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:37:03,578 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:37:03,580 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:37:03,911 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 07:37:03,912 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:37:03,924 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:37:03,925 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:37:03,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:37:03 BoogieIcfgContainer [2024-11-07 07:37:03,926 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:37:03,928 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:37:03,929 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:37:03,935 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:37:03,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:37:03" (1/3) ... [2024-11-07 07:37:03,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@643ff864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:37:03, skipping insertion in model container [2024-11-07 07:37:03,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:03" (2/3) ... [2024-11-07 07:37:03,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@643ff864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:37:03, skipping insertion in model container [2024-11-07 07:37:03,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:37:03" (3/3) ... [2024-11-07 07:37:03,939 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-38.i [2024-11-07 07:37:03,954 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:37:03,955 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:37:04,021 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:37:04,035 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;@2078db2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:37:04,036 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:37:04,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 07:37:04,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-07 07:37:04,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:37:04,057 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:37:04,058 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:37:04,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:37:04,065 INFO L85 PathProgramCache]: Analyzing trace with hash 449802896, now seen corresponding path program 1 times [2024-11-07 07:37:04,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:37:04,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698480469] [2024-11-07 07:37:04,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:37:04,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:37:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:37:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:37:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:37:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:37:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:37:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:37:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:37:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:37:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:37:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:37:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:37:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 07:37:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 07:37:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 07:37:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 07:37:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 07:37:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 07:37:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 07:37:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 07:37:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 07:37:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 07:37:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 07:37:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 07:37:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 07:37:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 07:37:04,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:37:04,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698480469] [2024-11-07 07:37:04,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698480469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:37:04,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:37:04,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:37:04,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78037886] [2024-11-07 07:37:04,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:37:04,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:37:04,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:37:04,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:37:04,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:37:04,514 INFO L87 Difference]: Start difference. First operand has 63 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 07:37:04,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:37:04,536 INFO L93 Difference]: Finished difference Result 119 states and 204 transitions. [2024-11-07 07:37:04,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:37:04,538 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 148 [2024-11-07 07:37:04,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:37:04,544 INFO L225 Difference]: With dead ends: 119 [2024-11-07 07:37:04,544 INFO L226 Difference]: Without dead ends: 59 [2024-11-07 07:37:04,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:37:04,551 INFO L432 NwaCegarLoop]: 86 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, 86 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:37:04,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:37:04,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-07 07:37:04,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-07 07:37:04,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 07:37:04,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2024-11-07 07:37:04,605 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 148 [2024-11-07 07:37:04,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:37:04,605 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2024-11-07 07:37:04,605 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 07:37:04,605 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2024-11-07 07:37:04,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-07 07:37:04,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:37:04,611 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:37:04,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 07:37:04,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:37:04,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:37:04,612 INFO L85 PathProgramCache]: Analyzing trace with hash 803808152, now seen corresponding path program 1 times [2024-11-07 07:37:04,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:37:04,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782934996] [2024-11-07 07:37:04,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:37:04,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:37:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:37:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:37:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:37:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:37:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:37:04,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:37:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:37:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:37:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:37:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:37:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:37:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 07:37:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 07:37:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 07:37:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 07:37:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 07:37:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 07:37:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 07:37:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 07:37:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 07:37:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 07:37:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 07:37:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 07:37:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 07:37:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 07:37:04,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:37:04,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782934996] [2024-11-07 07:37:04,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782934996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:37:04,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:37:04,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:37:04,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814515172] [2024-11-07 07:37:04,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:37:04,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:37:04,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:37:04,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:37:04,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:37:04,997 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 07:37:05,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:37:05,061 INFO L93 Difference]: Finished difference Result 149 states and 215 transitions. [2024-11-07 07:37:05,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:37:05,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 148 [2024-11-07 07:37:05,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:37:05,064 INFO L225 Difference]: With dead ends: 149 [2024-11-07 07:37:05,066 INFO L226 Difference]: Without dead ends: 93 [2024-11-07 07:37:05,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:37:05,068 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 45 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:37:05,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 158 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:37:05,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-07 07:37:05,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2024-11-07 07:37:05,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 52 states have internal predecessors, (57), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 07:37:05,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2024-11-07 07:37:05,093 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 148 [2024-11-07 07:37:05,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:37:05,096 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2024-11-07 07:37:05,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 07:37:05,097 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2024-11-07 07:37:05,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-07 07:37:05,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:37:05,102 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:37:05,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 07:37:05,102 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:37:05,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:37:05,103 INFO L85 PathProgramCache]: Analyzing trace with hash 805655194, now seen corresponding path program 1 times [2024-11-07 07:37:05,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:37:05,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701628152] [2024-11-07 07:37:05,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:37:05,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:37:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:05,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:37:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:05,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:37:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:05,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:37:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:05,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:37:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:05,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:37:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:05,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:37:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:06,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:37:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:06,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:37:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:06,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:37:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:06,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:37:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:06,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:37:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:06,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 07:37:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:06,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 07:37:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:06,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 07:37:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:06,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 07:37:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:06,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 07:37:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:06,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 07:37:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:06,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 07:37:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:06,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 07:37:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:06,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 07:37:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:06,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 07:37:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:06,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 07:37:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:06,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 07:37:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:06,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 07:37:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:06,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 12 proven. 120 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2024-11-07 07:37:06,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:37:06,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701628152] [2024-11-07 07:37:06,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701628152] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:37:06,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266098734] [2024-11-07 07:37:06,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:37:06,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:37:06,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:37:06,166 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 07:37:06,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 07:37:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:06,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 07:37:06,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:37:07,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 297 proven. 180 refuted. 0 times theorem prover too weak. 627 trivial. 0 not checked. [2024-11-07 07:37:07,678 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:37:08,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 12 proven. 123 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-07 07:37:08,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266098734] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 07:37:08,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 07:37:08,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 9] total 20 [2024-11-07 07:37:08,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256707237] [2024-11-07 07:37:08,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 07:37:08,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-07 07:37:08,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:37:08,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-07 07:37:08,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2024-11-07 07:37:08,120 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 6 states have call successors, (65), 4 states have call predecessors, (65), 8 states have return successors, (67), 5 states have call predecessors, (67), 6 states have call successors, (67) [2024-11-07 07:37:08,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:37:08,706 INFO L93 Difference]: Finished difference Result 207 states and 279 transitions. [2024-11-07 07:37:08,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 07:37:08,707 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 6 states have call successors, (65), 4 states have call predecessors, (65), 8 states have return successors, (67), 5 states have call predecessors, (67), 6 states have call successors, (67) Word has length 148 [2024-11-07 07:37:08,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:37:08,710 INFO L225 Difference]: With dead ends: 207 [2024-11-07 07:37:08,710 INFO L226 Difference]: Without dead ends: 120 [2024-11-07 07:37:08,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 331 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=227, Invalid=585, Unknown=0, NotChecked=0, Total=812 [2024-11-07 07:37:08,713 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 98 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 07:37:08,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 234 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 07:37:08,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-07 07:37:08,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2024-11-07 07:37:08,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 70 states have internal predecessors, (74), 36 states have call successors, (36), 8 states have call predecessors, (36), 8 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 07:37:08,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 146 transitions. [2024-11-07 07:37:08,736 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 146 transitions. Word has length 148 [2024-11-07 07:37:08,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:37:08,737 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 146 transitions. [2024-11-07 07:37:08,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 6 states have call successors, (65), 4 states have call predecessors, (65), 8 states have return successors, (67), 5 states have call predecessors, (67), 6 states have call successors, (67) [2024-11-07 07:37:08,738 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 146 transitions. [2024-11-07 07:37:08,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-07 07:37:08,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:37:08,740 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:37:08,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 07:37:08,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:37:08,941 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:37:08,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:37:08,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1485713564, now seen corresponding path program 1 times [2024-11-07 07:37:08,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:37:08,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844184582] [2024-11-07 07:37:08,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:37:08,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:37:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:37:09,039 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 07:37:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:37:09,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 07:37:09,134 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 07:37:09,135 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 07:37:09,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 07:37:09,139 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 07:37:09,240 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 07:37:09,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:37:09 BoogieIcfgContainer [2024-11-07 07:37:09,246 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 07:37:09,247 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 07:37:09,247 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 07:37:09,247 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 07:37:09,247 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:37:03" (3/4) ... [2024-11-07 07:37:09,249 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 07:37:09,250 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 07:37:09,251 INFO L158 Benchmark]: Toolchain (without parser) took 6213.04ms. Allocated memory was 117.4MB in the beginning and 184.5MB in the end (delta: 67.1MB). Free memory was 91.3MB in the beginning and 95.3MB in the end (delta: -4.0MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. [2024-11-07 07:37:09,252 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:37:09,252 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.26ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 77.8MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 07:37:09,253 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.26ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 75.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:37:09,253 INFO L158 Benchmark]: Boogie Preprocessor took 52.66ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 70.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:37:09,253 INFO L158 Benchmark]: RCFGBuilder took 491.60ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 52.9MB in the end (delta: 17.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 07:37:09,253 INFO L158 Benchmark]: TraceAbstraction took 5317.50ms. Allocated memory was 117.4MB in the beginning and 184.5MB in the end (delta: 67.1MB). Free memory was 52.4MB in the beginning and 95.4MB in the end (delta: -42.9MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2024-11-07 07:37:09,253 INFO L158 Benchmark]: Witness Printer took 3.58ms. Allocated memory is still 184.5MB. Free memory was 95.4MB in the beginning and 95.3MB in the end (delta: 52.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:37:09,254 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.17ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.26ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 77.8MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.26ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 75.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.66ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 70.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 491.60ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 52.9MB in the end (delta: 17.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5317.50ms. Allocated memory was 117.4MB in the beginning and 184.5MB in the end (delta: 67.1MB). Free memory was 52.4MB in the beginning and 95.4MB in the end (delta: -42.9MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. * Witness Printer took 3.58ms. Allocated memory is still 184.5MB. Free memory was 95.4MB in the beginning and 95.3MB in the end (delta: 52.0kB). 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 107, overapproximation of someBinaryArithmeticDOUBLEoperation at line 49. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned short int var_1_2 = 56507; [L24] unsigned short int var_1_3 = 52902; [L25] unsigned short int var_1_4 = 8; [L26] unsigned long int var_1_5 = 16; [L27] unsigned long int var_1_6 = 1771558822; [L28] double var_1_7 = 7.25; [L29] double var_1_8 = 31.2; [L30] double var_1_9 = 32.71; [L31] double var_1_10 = 0.4; [L32] double var_1_11 = 7.75; [L33] unsigned short int var_1_12 = 32; [L34] unsigned char var_1_13 = 0; [L35] unsigned short int var_1_14 = 20114; [L36] unsigned short int var_1_15 = 32; [L37] unsigned short int var_1_16 = 16773; [L38] unsigned short int var_1_17 = 25; [L39] unsigned char var_1_18 = 0; [L40] unsigned char var_1_19 = 1; VAL [isInitial=0, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=56507, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] FCALL updateLastVariables() [L115] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_ushort() [L66] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L66] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L67] CALL assume_abort_if_not(var_1_2 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L67] RET assume_abort_if_not(var_1_2 <= 65534) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L68] var_1_3 = __VERIFIER_nondet_ushort() [L69] CALL assume_abort_if_not(var_1_3 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L69] RET assume_abort_if_not(var_1_3 >= 32767) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L70] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L70] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L71] var_1_4 = __VERIFIER_nondet_ushort() [L72] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L72] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L73] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L73] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L74] var_1_6 = __VERIFIER_nondet_ulong() [L75] CALL assume_abort_if_not(var_1_6 >= 1610612735) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L75] RET assume_abort_if_not(var_1_6 >= 1610612735) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L76] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L76] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L77] var_1_8 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_9=3271/100] [L78] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_9=3271/100] [L79] var_1_9 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L80] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L81] var_1_10 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_10 >= -115292.1504606845700e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 1152921.504606845700e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L82] RET assume_abort_if_not((var_1_10 >= -115292.1504606845700e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 1152921.504606845700e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L83] var_1_11 = __VERIFIER_nondet_double() [L84] CALL assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L84] RET assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L85] var_1_13 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L86] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_12=32, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L87] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L87] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L88] var_1_14 = __VERIFIER_nondet_ushort() [L89] CALL assume_abort_if_not(var_1_14 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L89] RET assume_abort_if_not(var_1_14 >= 16383) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L90] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L90] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L91] var_1_15 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L92] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L93] CALL assume_abort_if_not(var_1_15 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L93] RET assume_abort_if_not(var_1_15 <= 16383) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L94] var_1_16 = __VERIFIER_nondet_ushort() [L95] CALL assume_abort_if_not(var_1_16 >= 16384) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103790081, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103790081, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L95] RET assume_abort_if_not(var_1_16 >= 16384) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103790081, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L96] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103790081, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103790081, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L96] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103790081, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L97] var_1_18 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103790081, var_1_17=25, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103790081, var_1_17=25, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L98] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103790081, var_1_17=25, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L99] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103790081, var_1_17=25, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103790081, var_1_17=25, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L99] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103790081, var_1_17=25, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L100] var_1_19 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103790081, var_1_17=25, var_1_18=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103790081, var_1_17=25, var_1_18=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L101] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103790081, var_1_17=25, var_1_18=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L102] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103790081, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103790081, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L102] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103790081, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L115] RET updateVariables() [L116] CALL step() [L44] var_1_1 = (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) - var_1_4) [L45] unsigned short int stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=32767, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103790081, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=1, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L46] COND FALSE !(var_1_4 > stepLocal_0) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103790081, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=1, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L49] var_1_7 = (var_1_8 + (var_1_9 + (var_1_10 + var_1_11))) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103790081, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=1, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647] [L50] COND TRUE ! var_1_13 [L51] var_1_12 = (var_1_3 - (var_1_14 - var_1_15)) VAL [isInitial=1, var_1_12=32768, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103790081, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=1, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647] [L59] unsigned char stepLocal_1 = var_1_19; VAL [isInitial=1, stepLocal_1=-255, var_1_12=32768, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103790081, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=1, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647] [L60] COND FALSE !((var_1_13 && var_1_18) && stepLocal_1) VAL [isInitial=1, var_1_12=32768, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103790081, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=1, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647] [L116] RET step() [L117] CALL, EXPR property() [L107-L108] return ((((var_1_1 == ((unsigned short int) (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) - var_1_4))) && ((var_1_4 > var_1_2) ? (var_1_5 == ((unsigned long int) (((var_1_6 - var_1_3) + 2144048120u) - var_1_2))) : 1)) && (var_1_7 == ((double) (var_1_8 + (var_1_9 + (var_1_10 + var_1_11)))))) && ((! var_1_13) ? (var_1_12 == ((unsigned short int) (var_1_3 - (var_1_14 - var_1_15)))) : (var_1_13 ? (var_1_12 == ((unsigned short int) ((27636 + var_1_16) - (((((16853 - 10)) > (var_1_14)) ? ((16853 - 10)) : (var_1_14)))))) : (var_1_12 == ((unsigned short int) var_1_3))))) && (((var_1_13 && var_1_18) && var_1_19) ? (var_1_17 == ((unsigned short int) (var_1_15 + var_1_14))) : 1) ; VAL [\result=0, isInitial=1, var_1_12=32768, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103790081, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=1, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647] [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=32768, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103790081, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=1, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647] [L19] reach_error() VAL [isInitial=1, var_1_12=32768, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103790081, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=1, var_1_2=32767, var_1_3=-1073643520, var_1_4=32767, var_1_5=16, var_1_6=2147483647] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 4, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 144 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 143 mSDsluCounter, 478 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 247 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 350 IncrementalHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 231 mSDtfsCounter, 350 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 485 GetRequests, 455 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=3, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 740 NumberOfCodeBlocks, 740 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 735 ConstructedInterpolants, 0 QuantifiedInterpolants, 3348 SizeOfPredicates, 3 NumberOfNonLiveVariables, 323 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 5097/5520 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 07:37:09,288 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_floatingpointinfluence_has-floats_file-38.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1fe81127d69b7276d52c9dc992cdfd5ba3c95fcd5376dc8c91bd7ac959faa3c0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:37:11,608 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:37:11,704 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 07:37:11,710 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:37:11,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:37:11,745 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:37:11,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:37:11,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:37:11,748 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:37:11,748 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:37:11,749 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:37:11,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:37:11,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:37:11,750 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:37:11,750 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:37:11,750 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:37:11,750 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:37:11,750 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:37:11,750 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:37:11,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:37:11,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:37:11,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:37:11,750 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:37:11,751 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 07:37:11,751 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 07:37:11,751 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:37:11,751 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 07:37:11,751 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:37:11,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:37:11,751 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:37:11,751 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:37:11,751 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:37:11,751 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:37:11,751 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:37:11,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:37:11,751 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:37:11,751 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:37:11,751 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:37:11,752 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 07:37:11,752 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 07:37:11,752 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:37:11,752 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:37:11,752 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:37:11,752 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:37:11,752 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 -> 1fe81127d69b7276d52c9dc992cdfd5ba3c95fcd5376dc8c91bd7ac959faa3c0 [2024-11-07 07:37:12,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:37:12,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:37:12,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:37:12,068 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:37:12,069 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:37:12,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-38.i [2024-11-07 07:37:13,495 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:37:13,722 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:37:13,723 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-38.i [2024-11-07 07:37:13,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f71ca4adb/ec95531f1b374570b768e39844d8b936/FLAG6954dc603 [2024-11-07 07:37:13,755 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f71ca4adb/ec95531f1b374570b768e39844d8b936 [2024-11-07 07:37:13,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:37:13,760 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:37:13,761 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:37:13,761 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:37:13,766 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:37:13,767 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:37:13" (1/1) ... [2024-11-07 07:37:13,770 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58622248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:13, skipping insertion in model container [2024-11-07 07:37:13,772 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:37:13" (1/1) ... [2024-11-07 07:37:13,791 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:37:13,935 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_floatingpointinfluence_has-floats_file-38.i[917,930] [2024-11-07 07:37:13,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:37:14,014 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:37:14,027 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_floatingpointinfluence_has-floats_file-38.i[917,930] [2024-11-07 07:37:14,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:37:14,083 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:37:14,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:14 WrapperNode [2024-11-07 07:37:14,085 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:37:14,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:37:14,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:37:14,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:37:14,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:14" (1/1) ... [2024-11-07 07:37:14,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:14" (1/1) ... [2024-11-07 07:37:14,141 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-11-07 07:37:14,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:37:14,146 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:37:14,146 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:37:14,146 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:37:14,155 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:14" (1/1) ... [2024-11-07 07:37:14,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:14" (1/1) ... [2024-11-07 07:37:14,159 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:14" (1/1) ... [2024-11-07 07:37:14,173 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 07:37:14,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:14" (1/1) ... [2024-11-07 07:37:14,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:14" (1/1) ... [2024-11-07 07:37:14,185 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:14" (1/1) ... [2024-11-07 07:37:14,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:14" (1/1) ... [2024-11-07 07:37:14,194 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:14" (1/1) ... [2024-11-07 07:37:14,195 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:14" (1/1) ... [2024-11-07 07:37:14,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:37:14,198 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:37:14,198 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:37:14,199 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:37:14,200 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:14" (1/1) ... [2024-11-07 07:37:14,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:37:14,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:37:14,242 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 07:37:14,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 07:37:14,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:37:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 07:37:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:37:14,266 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:37:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:37:14,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:37:14,347 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:37:14,349 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:37:17,264 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 07:37:17,264 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:37:17,276 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:37:17,276 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:37:17,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:37:17 BoogieIcfgContainer [2024-11-07 07:37:17,277 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:37:17,280 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:37:17,280 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:37:17,285 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:37:17,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:37:13" (1/3) ... [2024-11-07 07:37:17,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e8fe1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:37:17, skipping insertion in model container [2024-11-07 07:37:17,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:14" (2/3) ... [2024-11-07 07:37:17,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e8fe1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:37:17, skipping insertion in model container [2024-11-07 07:37:17,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:37:17" (3/3) ... [2024-11-07 07:37:17,287 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-38.i [2024-11-07 07:37:17,301 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:37:17,302 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:37:17,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:37:17,396 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;@6deba10e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:37:17,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:37:17,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 07:37:17,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-07 07:37:17,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:37:17,417 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:37:17,417 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:37:17,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:37:17,423 INFO L85 PathProgramCache]: Analyzing trace with hash 449802896, now seen corresponding path program 1 times [2024-11-07 07:37:17,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:37:17,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217100736] [2024-11-07 07:37:17,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:37:17,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:37:17,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:37:17,442 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:37:17,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 07:37:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:17,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 07:37:17,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:37:17,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-07 07:37:17,857 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:37:17,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:37:17,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [217100736] [2024-11-07 07:37:17,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [217100736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:37:17,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:37:17,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:37:17,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846346480] [2024-11-07 07:37:17,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:37:17,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:37:17,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:37:17,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:37:17,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:37:17,888 INFO L87 Difference]: Start difference. First operand has 63 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 07:37:17,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:37:17,915 INFO L93 Difference]: Finished difference Result 119 states and 204 transitions. [2024-11-07 07:37:17,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:37:17,917 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 148 [2024-11-07 07:37:17,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:37:17,922 INFO L225 Difference]: With dead ends: 119 [2024-11-07 07:37:17,922 INFO L226 Difference]: Without dead ends: 59 [2024-11-07 07:37:17,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:37:17,927 INFO L432 NwaCegarLoop]: 86 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, 86 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:37:17,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:37:17,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-07 07:37:17,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-07 07:37:17,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 07:37:17,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2024-11-07 07:37:17,964 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 148 [2024-11-07 07:37:17,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:37:17,964 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2024-11-07 07:37:17,964 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 07:37:17,964 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2024-11-07 07:37:17,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-07 07:37:17,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:37:17,967 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:37:17,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 07:37:18,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:37:18,168 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:37:18,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:37:18,169 INFO L85 PathProgramCache]: Analyzing trace with hash 803808152, now seen corresponding path program 1 times [2024-11-07 07:37:18,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:37:18,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551850782] [2024-11-07 07:37:18,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:37:18,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:37:18,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:37:18,173 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:37:18,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 07:37:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:18,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 07:37:18,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:37:18,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 07:37:18,633 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:37:18,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:37:18,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551850782] [2024-11-07 07:37:18,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [551850782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:37:18,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:37:18,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:37:18,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36832047] [2024-11-07 07:37:18,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:37:18,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:37:18,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:37:18,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:37:18,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:37:18,637 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 07:37:21,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:37:23,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:37:23,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:37:23,232 INFO L93 Difference]: Finished difference Result 149 states and 215 transitions. [2024-11-07 07:37:23,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:37:23,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 148 [2024-11-07 07:37:23,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:37:23,265 INFO L225 Difference]: With dead ends: 149 [2024-11-07 07:37:23,265 INFO L226 Difference]: Without dead ends: 93 [2024-11-07 07:37:23,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:37:23,268 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 45 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-07 07:37:23,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 157 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-07 07:37:23,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-07 07:37:23,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2024-11-07 07:37:23,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 52 states have internal predecessors, (57), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 07:37:23,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2024-11-07 07:37:23,297 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 148 [2024-11-07 07:37:23,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:37:23,298 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2024-11-07 07:37:23,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 07:37:23,298 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2024-11-07 07:37:23,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-07 07:37:23,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:37:23,300 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:37:23,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 07:37:23,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:37:23,501 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:37:23,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:37:23,502 INFO L85 PathProgramCache]: Analyzing trace with hash 805655194, now seen corresponding path program 1 times [2024-11-07 07:37:23,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:37:23,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897328070] [2024-11-07 07:37:23,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:37:23,503 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:37:23,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:37:23,507 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:37:23,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 07:37:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:24,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-07 07:37:24,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:38:06,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 339 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-11-07 07:38:06,404 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:38:27,308 WARN L286 SmtUtils]: Spent 6.18s 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)