./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-25.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', 'c147c84511e5c0677a9069c27a4d754d19564d6e4b1f08886ba1a76b5d6b51d6'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-25.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 c147c84511e5c0677a9069c27a4d754d19564d6e4b1f08886ba1a76b5d6b51d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:07:45,886 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:07:45,983 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 08:07:45,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:07:45,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:07:46,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:07:46,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:07:46,022 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:07:46,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:07:46,023 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:07:46,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:07:46,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:07:46,024 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:07:46,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:07:46,024 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:07:46,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:07:46,025 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:07:46,026 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:07:46,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:07:46,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:07:46,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:07:46,026 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:07:46,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:07:46,026 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:07:46,026 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:07:46,026 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:07:46,026 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:07:46,026 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:07:46,026 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:07:46,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:07:46,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:07:46,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:07:46,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:07:46,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:07:46,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:07:46,027 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:07:46,027 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:07:46,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:07:46,027 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:07:46,027 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:07:46,027 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:07:46,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:07:46,027 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 -> c147c84511e5c0677a9069c27a4d754d19564d6e4b1f08886ba1a76b5d6b51d6 [2024-11-07 08:07:46,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:07:46,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:07:46,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:07:46,336 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:07:46,336 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:07:46,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-25.i [2024-11-07 08:07:47,665 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:07:47,962 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:07:47,964 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-25.i [2024-11-07 08:07:47,974 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a804e3e8d/0f99342dbf5e4dbe97dc5d38f1e526f7/FLAGb5fbe9860 [2024-11-07 08:07:47,993 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a804e3e8d/0f99342dbf5e4dbe97dc5d38f1e526f7 [2024-11-07 08:07:47,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:07:47,998 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:07:48,000 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:07:48,000 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:07:48,004 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:07:48,005 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:07:47" (1/1) ... [2024-11-07 08:07:48,006 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f1f55f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:07:48, skipping insertion in model container [2024-11-07 08:07:48,007 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:07:47" (1/1) ... [2024-11-07 08:07:48,033 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:07:48,168 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-25.i[916,929] [2024-11-07 08:07:48,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:07:48,283 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:07:48,296 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-25.i[916,929] [2024-11-07 08:07:48,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:07:48,362 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:07:48,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:07:48 WrapperNode [2024-11-07 08:07:48,364 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:07:48,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:07:48,366 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:07:48,366 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:07:48,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:07:48" (1/1) ... [2024-11-07 08:07:48,388 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:07:48" (1/1) ... [2024-11-07 08:07:48,447 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2024-11-07 08:07:48,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:07:48,448 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:07:48,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:07:48,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:07:48,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:07:48" (1/1) ... [2024-11-07 08:07:48,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:07:48" (1/1) ... [2024-11-07 08:07:48,464 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:07:48" (1/1) ... [2024-11-07 08:07:48,492 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 08:07:48,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:07:48" (1/1) ... [2024-11-07 08:07:48,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:07:48" (1/1) ... [2024-11-07 08:07:48,504 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:07:48" (1/1) ... [2024-11-07 08:07:48,508 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:07:48" (1/1) ... [2024-11-07 08:07:48,512 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:07:48" (1/1) ... [2024-11-07 08:07:48,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:07:48" (1/1) ... [2024-11-07 08:07:48,520 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:07:48,522 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:07:48,523 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:07:48,523 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:07:48,524 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:07:48" (1/1) ... [2024-11-07 08:07:48,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:07:48,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:07:48,557 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 08:07:48,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 08:07:48,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:07:48,581 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:07:48,581 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:07:48,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:07:48,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:07:48,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:07:48,682 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:07:48,684 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:07:49,102 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-07 08:07:49,103 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:07:49,114 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:07:49,115 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:07:49,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:07:49 BoogieIcfgContainer [2024-11-07 08:07:49,117 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:07:49,118 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:07:49,119 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:07:49,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:07:49,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:07:47" (1/3) ... [2024-11-07 08:07:49,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f8d770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:07:49, skipping insertion in model container [2024-11-07 08:07:49,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:07:48" (2/3) ... [2024-11-07 08:07:49,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f8d770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:07:49, skipping insertion in model container [2024-11-07 08:07:49,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:07:49" (3/3) ... [2024-11-07 08:07:49,126 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-25.i [2024-11-07 08:07:49,138 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:07:49,138 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:07:49,181 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:07:49,192 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;@32d2cb62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:07:49,193 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:07:49,197 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 58 states have internal predecessors, (80), 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 08:07:49,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-07 08:07:49,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:07:49,208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:07:49,209 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:07:49,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:07:49,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1261889, now seen corresponding path program 1 times [2024-11-07 08:07:49,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:07:49,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906358656] [2024-11-07 08:07:49,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:07:49,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:07:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:49,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:07:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:49,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:07:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:49,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:07:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:49,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:07:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:49,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:07:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:49,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:07:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:49,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:07:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:49,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:07:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:49,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:07:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:49,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:07:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:49,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:07:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:49,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:07:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:49,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:07:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:49,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 08:07:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:49,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 08:07:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:49,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 08:07:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:49,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 08:07:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:49,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 08:07:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:49,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 08:07:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:49,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 08:07:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:49,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 08:07:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:49,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:07:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:49,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 08:07:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:49,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 08:07:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:49,747 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 08:07:49,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:07:49,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906358656] [2024-11-07 08:07:49,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906358656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:07:49,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:07:49,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:07:49,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846864330] [2024-11-07 08:07:49,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:07:49,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:07:49,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:07:49,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:07:49,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:07:49,797 INFO L87 Difference]: Start difference. First operand has 84 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 58 states have internal predecessors, (80), 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 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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 08:07:49,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:07:49,831 INFO L93 Difference]: Finished difference Result 161 states and 274 transitions. [2024-11-07 08:07:49,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:07:49,833 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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 164 [2024-11-07 08:07:49,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:07:49,840 INFO L225 Difference]: With dead ends: 161 [2024-11-07 08:07:49,841 INFO L226 Difference]: Without dead ends: 80 [2024-11-07 08:07:49,845 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 08:07:49,849 INFO L432 NwaCegarLoop]: 121 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, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:07:49,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:07:49,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-07 08:07:49,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-07 08:07:49,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 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 08:07:49,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 121 transitions. [2024-11-07 08:07:49,900 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 121 transitions. Word has length 164 [2024-11-07 08:07:49,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:07:49,901 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 121 transitions. [2024-11-07 08:07:49,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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 08:07:49,901 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 121 transitions. [2024-11-07 08:07:49,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-07 08:07:49,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:07:49,904 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:07:49,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:07:49,905 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:07:49,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:07:49,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1353077193, now seen corresponding path program 1 times [2024-11-07 08:07:49,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:07:49,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474387467] [2024-11-07 08:07:49,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:07:49,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:07:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:50,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:07:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:50,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:07:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:50,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:07:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:50,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:07:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:50,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:07:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:50,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:07:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:50,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:07:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:50,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:07:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:50,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:07:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:50,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:07:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:50,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:07:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:50,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:07:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:50,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:07:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:50,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 08:07:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:50,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 08:07:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:50,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 08:07:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:50,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 08:07:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:50,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 08:07:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:50,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 08:07:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:50,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 08:07:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:50,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 08:07:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:50,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:07:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:50,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 08:07:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:50,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 08:07:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:50,347 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 08:07:50,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:07:50,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474387467] [2024-11-07 08:07:50,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474387467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:07:50,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:07:50,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:07:50,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757534966] [2024-11-07 08:07:50,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:07:50,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:07:50,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:07:50,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:07:50,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:07:50,354 INFO L87 Difference]: Start difference. First operand 80 states and 121 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 08:07:50,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:07:50,425 INFO L93 Difference]: Finished difference Result 188 states and 285 transitions. [2024-11-07 08:07:50,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:07:50,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 164 [2024-11-07 08:07:50,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:07:50,429 INFO L225 Difference]: With dead ends: 188 [2024-11-07 08:07:50,432 INFO L226 Difference]: Without dead ends: 111 [2024-11-07 08:07:50,432 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 08:07:50,433 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 36 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:07:50,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 231 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:07:50,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-07 08:07:50,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2024-11-07 08:07:50,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 76 states have internal predecessors, (107), 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 08:07:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2024-11-07 08:07:50,454 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 155 transitions. Word has length 164 [2024-11-07 08:07:50,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:07:50,459 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 155 transitions. [2024-11-07 08:07:50,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 08:07:50,459 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 155 transitions. [2024-11-07 08:07:50,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 08:07:50,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:07:50,462 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:07:50,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:07:50,462 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:07:50,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:07:50,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1146571696, now seen corresponding path program 1 times [2024-11-07 08:07:50,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:07:50,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136315170] [2024-11-07 08:07:50,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:07:50,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:07:50,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:51,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:07:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:51,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:07:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:51,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:07:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:51,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:07:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:51,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:07:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:51,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:07:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:51,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:07:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:51,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:07:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:51,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:07:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:51,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:07:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:51,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:07:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:51,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:07:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:51,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:07:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:51,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 08:07:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:51,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 08:07:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:51,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 08:07:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:51,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 08:07:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:51,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 08:07:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:51,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 08:07:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:51,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 08:07:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:51,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 08:07:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:51,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:07:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:51,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 08:07:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:51,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 08:07:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:51,603 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 08:07:51,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:07:51,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136315170] [2024-11-07 08:07:51,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136315170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:07:51,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:07:51,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 08:07:51,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356598865] [2024-11-07 08:07:51,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:07:51,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 08:07:51,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:07:51,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 08:07:51,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 08:07:51,608 INFO L87 Difference]: Start difference. First operand 102 states and 155 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 08:07:52,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:07:52,080 INFO L93 Difference]: Finished difference Result 365 states and 554 transitions. [2024-11-07 08:07:52,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 08:07:52,081 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 165 [2024-11-07 08:07:52,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:07:52,087 INFO L225 Difference]: With dead ends: 365 [2024-11-07 08:07:52,087 INFO L226 Difference]: Without dead ends: 266 [2024-11-07 08:07:52,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 08:07:52,089 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 171 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 08:07:52,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 453 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 08:07:52,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-07 08:07:52,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 168. [2024-11-07 08:07:52,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 117 states have (on average 1.3675213675213675) internal successors, (160), 117 states have internal predecessors, (160), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 08:07:52,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2024-11-07 08:07:52,133 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 165 [2024-11-07 08:07:52,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:07:52,135 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2024-11-07 08:07:52,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 08:07:52,135 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2024-11-07 08:07:52,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 08:07:52,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:07:52,140 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:07:52,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 08:07:52,140 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:07:52,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:07:52,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1553744, now seen corresponding path program 1 times [2024-11-07 08:07:52,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:07:52,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141676134] [2024-11-07 08:07:52,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:07:52,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:07:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:53,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:07:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:53,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:07:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:53,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:07:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:53,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:07:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:53,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:07:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:53,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:07:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:53,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:07:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:53,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:07:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:53,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:07:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:53,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:07:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:53,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:07:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:53,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:07:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:53,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:07:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:53,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 08:07:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:53,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 08:07:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:53,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 08:07:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:53,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 08:07:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:53,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 08:07:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:53,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 08:07:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:53,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 08:07:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:53,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 08:07:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:53,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:07:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:53,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 08:07:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:53,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 08:07:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:53,153 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 08:07:53,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:07:53,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141676134] [2024-11-07 08:07:53,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141676134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:07:53,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:07:53,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 08:07:53,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297000439] [2024-11-07 08:07:53,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:07:53,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 08:07:53,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:07:53,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 08:07:53,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:07:53,156 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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 08:07:53,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:07:53,873 INFO L93 Difference]: Finished difference Result 365 states and 552 transitions. [2024-11-07 08:07:53,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 08:07:53,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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 165 [2024-11-07 08:07:53,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:07:53,877 INFO L225 Difference]: With dead ends: 365 [2024-11-07 08:07:53,877 INFO L226 Difference]: Without dead ends: 266 [2024-11-07 08:07:53,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-07 08:07:53,878 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 166 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 08:07:53,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 570 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 08:07:53,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-07 08:07:53,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 170. [2024-11-07 08:07:53,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 119 states have (on average 1.361344537815126) internal successors, (162), 119 states have internal predecessors, (162), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 08:07:53,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 258 transitions. [2024-11-07 08:07:53,910 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 258 transitions. Word has length 165 [2024-11-07 08:07:53,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:07:53,910 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 258 transitions. [2024-11-07 08:07:53,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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 08:07:53,911 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 258 transitions. [2024-11-07 08:07:53,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 08:07:53,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:07:53,914 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:07:53,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 08:07:53,914 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:07:53,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:07:53,915 INFO L85 PathProgramCache]: Analyzing trace with hash 681612114, now seen corresponding path program 1 times [2024-11-07 08:07:53,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:07:53,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366590206] [2024-11-07 08:07:53,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:07:53,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:07:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:55,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:07:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:55,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:07:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:55,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:07:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:55,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:07:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:55,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:07:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:55,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:07:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:55,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:07:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:55,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:07:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:55,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:07:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:55,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:07:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:55,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:07:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:55,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:07:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:55,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:07:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:55,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 08:07:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:55,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 08:07:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:55,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 08:07:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:55,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 08:07:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:56,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 08:07:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:56,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 08:07:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:56,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 08:07:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:56,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 08:07:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:56,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:07:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:56,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 08:07:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:56,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 08:07:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:56,098 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 08:07:56,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:07:56,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366590206] [2024-11-07 08:07:56,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366590206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:07:56,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:07:56,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 08:07:56,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632718081] [2024-11-07 08:07:56,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:07:56,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 08:07:56,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:07:56,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 08:07:56,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 08:07:56,102 INFO L87 Difference]: Start difference. First operand 170 states and 258 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 08:07:57,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:07:57,401 INFO L93 Difference]: Finished difference Result 522 states and 789 transitions. [2024-11-07 08:07:57,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 08:07:57,402 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 165 [2024-11-07 08:07:57,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:07:57,405 INFO L225 Difference]: With dead ends: 522 [2024-11-07 08:07:57,406 INFO L226 Difference]: Without dead ends: 423 [2024-11-07 08:07:57,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2024-11-07 08:07:57,407 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 429 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 08:07:57,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 617 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 08:07:57,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-11-07 08:07:57,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 203. [2024-11-07 08:07:57,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 152 states have (on average 1.388157894736842) internal successors, (211), 152 states have internal predecessors, (211), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 08:07:57,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 307 transitions. [2024-11-07 08:07:57,452 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 307 transitions. Word has length 165 [2024-11-07 08:07:57,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:07:57,452 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 307 transitions. [2024-11-07 08:07:57,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 08:07:57,453 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 307 transitions. [2024-11-07 08:07:57,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 08:07:57,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:07:57,457 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:07:57,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 08:07:57,457 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:07:57,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:07:57,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1838347820, now seen corresponding path program 1 times [2024-11-07 08:07:57,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:07:57,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644020156] [2024-11-07 08:07:57,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:07:57,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:07:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:57,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:07:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:57,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:07:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:57,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:07:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:57,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:07:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:57,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:07:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:57,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:07:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:57,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:07:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:57,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:07:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:57,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:07:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:57,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:07:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:57,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:07:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:57,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:07:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:57,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:07:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:57,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 08:07:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:57,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 08:07:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:57,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 08:07:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:57,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 08:07:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:57,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 08:07:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:57,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 08:07:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:57,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 08:07:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:57,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 08:07:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:57,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:07:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:57,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 08:07:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:57,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 08:07:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:57,920 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 08:07:57,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:07:57,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644020156] [2024-11-07 08:07:57,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644020156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:07:57,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:07:57,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:07:57,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870917359] [2024-11-07 08:07:57,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:07:57,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:07:57,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:07:57,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:07:57,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:07:57,924 INFO L87 Difference]: Start difference. First operand 203 states and 307 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 08:07:58,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:07:58,121 INFO L93 Difference]: Finished difference Result 417 states and 624 transitions. [2024-11-07 08:07:58,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:07:58,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 165 [2024-11-07 08:07:58,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:07:58,126 INFO L225 Difference]: With dead ends: 417 [2024-11-07 08:07:58,126 INFO L226 Difference]: Without dead ends: 271 [2024-11-07 08:07:58,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:07:58,129 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 42 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:07:58,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 284 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:07:58,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-07 08:07:58,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 252. [2024-11-07 08:07:58,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 197 states have (on average 1.3908629441624365) internal successors, (274), 198 states have internal predecessors, (274), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-07 08:07:58,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 374 transitions. [2024-11-07 08:07:58,165 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 374 transitions. Word has length 165 [2024-11-07 08:07:58,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:07:58,168 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 374 transitions. [2024-11-07 08:07:58,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 08:07:58,168 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 374 transitions. [2024-11-07 08:07:58,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 08:07:58,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:07:58,170 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:07:58,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 08:07:58,171 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:07:58,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:07:58,171 INFO L85 PathProgramCache]: Analyzing trace with hash -382681584, now seen corresponding path program 1 times [2024-11-07 08:07:58,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:07:58,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798757411] [2024-11-07 08:07:58,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:07:58,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:07:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:58,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:07:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:58,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:07:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:58,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:07:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:58,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:07:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:58,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:07:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:58,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:07:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:58,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:07:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:58,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:07:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:58,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:07:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:58,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:07:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:58,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:07:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:58,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:07:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:58,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:07:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:58,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 08:07:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:58,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 08:07:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:58,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 08:07:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:58,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 08:07:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:58,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 08:07:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:58,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 08:07:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:58,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 08:07:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:58,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 08:07:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:58,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:07:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:58,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 08:07:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:58,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 08:07:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:58,604 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 08:07:58,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:07:58,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798757411] [2024-11-07 08:07:58,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798757411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:07:58,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:07:58,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 08:07:58,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534917777] [2024-11-07 08:07:58,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:07:58,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 08:07:58,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:07:58,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 08:07:58,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 08:07:58,606 INFO L87 Difference]: Start difference. First operand 252 states and 374 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 08:07:58,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:07:58,937 INFO L93 Difference]: Finished difference Result 510 states and 752 transitions. [2024-11-07 08:07:58,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 08:07:58,939 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 165 [2024-11-07 08:07:58,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:07:58,943 INFO L225 Difference]: With dead ends: 510 [2024-11-07 08:07:58,944 INFO L226 Difference]: Without dead ends: 361 [2024-11-07 08:07:58,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 08:07:58,945 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 146 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:07:58,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 561 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 08:07:58,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-07 08:07:58,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 317. [2024-11-07 08:07:58,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 251 states have (on average 1.3824701195219125) internal successors, (347), 253 states have internal predecessors, (347), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 08:07:58,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 467 transitions. [2024-11-07 08:07:58,984 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 467 transitions. Word has length 165 [2024-11-07 08:07:58,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:07:58,986 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 467 transitions. [2024-11-07 08:07:58,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 08:07:58,986 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 467 transitions. [2024-11-07 08:07:58,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 08:07:58,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:07:58,989 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:07:58,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 08:07:58,989 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:07:58,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:07:58,990 INFO L85 PathProgramCache]: Analyzing trace with hash 765443856, now seen corresponding path program 1 times [2024-11-07 08:07:58,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:07:58,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380735112] [2024-11-07 08:07:58,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:07:58,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:07:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:59,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:07:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:59,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:07:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:59,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:07:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:59,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:07:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:59,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:07:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:59,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:07:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:59,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:07:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:59,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:07:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:59,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:07:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:59,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 08:07:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:59,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 08:07:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:59,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:07:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:59,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 08:07:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:59,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 08:07:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:59,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 08:07:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:59,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 08:07:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:59,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 08:07:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:59,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 08:07:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:59,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 08:07:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:59,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 08:07:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:59,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 08:07:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:59,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 08:07:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:59,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 08:07:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:59,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 08:07:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:07:59,343 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 08:07:59,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:07:59,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380735112] [2024-11-07 08:07:59,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380735112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:07:59,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:07:59,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 08:07:59,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461411604] [2024-11-07 08:07:59,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:07:59,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 08:07:59,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:07:59,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 08:07:59,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:07:59,345 INFO L87 Difference]: Start difference. First operand 317 states and 467 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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 08:07:59,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:07:59,703 INFO L93 Difference]: Finished difference Result 588 states and 862 transitions. [2024-11-07 08:07:59,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 08:07:59,704 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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 165 [2024-11-07 08:07:59,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:07:59,708 INFO L225 Difference]: With dead ends: 588 [2024-11-07 08:07:59,708 INFO L226 Difference]: Without dead ends: 407 [2024-11-07 08:07:59,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-07 08:07:59,709 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 175 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:07:59,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 619 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 08:07:59,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-11-07 08:07:59,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 381. [2024-11-07 08:07:59,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 289 states have (on average 1.3321799307958477) internal successors, (385), 292 states have internal predecessors, (385), 84 states have call successors, (84), 7 states have call predecessors, (84), 7 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-07 08:07:59,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 553 transitions. [2024-11-07 08:07:59,745 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 553 transitions. Word has length 165 [2024-11-07 08:07:59,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:07:59,746 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 553 transitions. [2024-11-07 08:07:59,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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 08:07:59,749 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 553 transitions. [2024-11-07 08:07:59,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 08:07:59,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:07:59,751 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:07:59,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 08:07:59,751 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:07:59,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:07:59,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1445502226, now seen corresponding path program 1 times [2024-11-07 08:07:59,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:07:59,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105896179] [2024-11-07 08:07:59,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:07:59,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:07:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 08:07:59,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1919140088] [2024-11-07 08:07:59,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:07:59,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:07:59,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:07:59,997 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 08:07:59,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 08:08:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:08:00,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 08:08:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:08:00,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 08:08:00,526 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 08:08:00,527 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:08:00,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 08:08:00,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:08:00,733 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:08:00,895 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:08:00,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:08:00 BoogieIcfgContainer [2024-11-07 08:08:00,901 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:08:00,902 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:08:00,902 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:08:00,902 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:08:00,903 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:07:49" (3/4) ... [2024-11-07 08:08:00,905 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 08:08:00,906 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:08:00,907 INFO L158 Benchmark]: Toolchain (without parser) took 12909.01ms. Allocated memory was 100.7MB in the beginning and 251.7MB in the end (delta: 151.0MB). Free memory was 76.7MB in the beginning and 166.1MB in the end (delta: -89.4MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. [2024-11-07 08:08:00,907 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:08:00,907 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.69ms. Allocated memory is still 100.7MB. Free memory was 76.6MB in the beginning and 60.7MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 08:08:00,908 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.73ms. Allocated memory is still 100.7MB. Free memory was 60.7MB in the beginning and 57.0MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:08:00,908 INFO L158 Benchmark]: Boogie Preprocessor took 73.50ms. Allocated memory is still 100.7MB. Free memory was 57.0MB in the beginning and 51.2MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:08:00,908 INFO L158 Benchmark]: RCFGBuilder took 594.27ms. Allocated memory is still 100.7MB. Free memory was 51.2MB in the beginning and 62.1MB in the end (delta: -10.9MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2024-11-07 08:08:00,909 INFO L158 Benchmark]: TraceAbstraction took 11783.04ms. Allocated memory was 100.7MB in the beginning and 251.7MB in the end (delta: 151.0MB). Free memory was 61.7MB in the beginning and 166.2MB in the end (delta: -104.5MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. [2024-11-07 08:08:00,909 INFO L158 Benchmark]: Witness Printer took 3.78ms. Allocated memory is still 251.7MB. Free memory was 166.2MB in the beginning and 166.1MB in the end (delta: 41.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:08:00,911 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.69ms. Allocated memory is still 100.7MB. Free memory was 76.6MB in the beginning and 60.7MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.73ms. Allocated memory is still 100.7MB. Free memory was 60.7MB in the beginning and 57.0MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 73.50ms. Allocated memory is still 100.7MB. Free memory was 57.0MB in the beginning and 51.2MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 594.27ms. Allocated memory is still 100.7MB. Free memory was 51.2MB in the beginning and 62.1MB in the end (delta: -10.9MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. * TraceAbstraction took 11783.04ms. Allocated memory was 100.7MB in the beginning and 251.7MB in the end (delta: 151.0MB). Free memory was 61.7MB in the beginning and 166.2MB in the end (delta: -104.5MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. * Witness Printer took 3.78ms. Allocated memory is still 251.7MB. Free memory was 166.2MB in the beginning and 166.1MB in the end (delta: 41.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 193. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] signed short int var_1_4 = -256; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 1; [L26] double var_1_7 = 256.25; [L27] double var_1_8 = 127.8; [L28] signed short int var_1_10 = -2; [L29] signed short int var_1_11 = 5; [L30] signed short int var_1_12 = 16; [L31] unsigned long int var_1_13 = 1000000000; [L32] signed long int var_1_14 = -100000000; [L33] double var_1_16 = 50.8; [L34] double var_1_17 = 2.2; [L35] double var_1_18 = 2.675; [L36] double var_1_19 = 100.5; [L37] unsigned short int var_1_20 = 46250; [L38] double var_1_21 = 99999999999.75; [L39] double var_1_22 = 32.4; [L40] double var_1_23 = 15.25; [L41] signed short int var_1_24 = -100; [L42] signed char var_1_25 = -1; [L43] unsigned short int var_1_26 = 128; [L44] unsigned long int var_1_27 = 8; [L45] signed short int var_1_28 = -4; [L46] unsigned long int var_1_29 = 100; [L47] unsigned long int var_1_30 = 100; [L48] unsigned long int var_1_31 = 1000000000; [L49] double var_1_32 = 0.0; [L50] signed long int last_1_var_1_1 = -64; [L51] signed long int last_1_var_1_14 = -100000000; [L52] double last_1_var_1_16 = 50.8; [L53] signed short int last_1_var_1_24 = -100; [L54] signed short int last_1_var_1_28 = -4; [L55] unsigned long int last_1_var_1_29 = 100; [L56] unsigned long int last_1_var_1_30 = 100; VAL [isInitial=0, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=1, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L197] isInitial = 1 [L198] FCALL initially() [L199] COND TRUE 1 [L200] CALL updateLastVariables() [L184] last_1_var_1_1 = var_1_1 [L185] last_1_var_1_14 = var_1_14 [L186] last_1_var_1_16 = var_1_16 [L187] last_1_var_1_24 = var_1_24 [L188] last_1_var_1_28 = var_1_28 [L189] last_1_var_1_29 = var_1_29 [L190] last_1_var_1_30 = var_1_30 VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=1, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L200] RET updateLastVariables() [L201] CALL updateVariables() [L143] var_1_5 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L144] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L145] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L145] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L146] var_1_6 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_7=1025/4, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_7=1025/4, var_1_8=639/5] [L147] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_7=1025/4, var_1_8=639/5] [L148] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0, var_1_7=1025/4, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0, var_1_7=1025/4, var_1_8=639/5] [L148] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0, var_1_7=1025/4, var_1_8=639/5] [L149] var_1_7 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0, var_1_8=639/5] [L150] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0, var_1_8=639/5] [L151] var_1_8 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L152] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L153] var_1_10 = __VERIFIER_nondet_short() [L154] CALL assume_abort_if_not(var_1_10 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L154] RET assume_abort_if_not(var_1_10 >= -16383) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L155] CALL assume_abort_if_not(var_1_10 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L155] RET assume_abort_if_not(var_1_10 <= 16383) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L156] var_1_11 = __VERIFIER_nondet_short() [L157] CALL assume_abort_if_not(var_1_11 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L157] RET assume_abort_if_not(var_1_11 >= -1) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L158] CALL assume_abort_if_not(var_1_11 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L158] RET assume_abort_if_not(var_1_11 <= 32766) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L159] var_1_12 = __VERIFIER_nondet_short() [L160] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L160] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L161] CALL assume_abort_if_not(var_1_12 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L161] RET assume_abort_if_not(var_1_12 <= 32766) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L162] var_1_17 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L163] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L164] var_1_18 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L165] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L166] var_1_20 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_20 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L167] RET assume_abort_if_not(var_1_20 >= 32767) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L168] CALL assume_abort_if_not(var_1_20 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L168] RET assume_abort_if_not(var_1_20 <= 65535) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L169] var_1_21 = __VERIFIER_nondet_double() [L170] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L170] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L171] var_1_22 = __VERIFIER_nondet_double() [L172] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L172] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L173] var_1_23 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L174] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L175] var_1_25 = __VERIFIER_nondet_char() [L176] CALL assume_abort_if_not(var_1_25 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_24=-100, var_1_25=2, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_24=-100, var_1_25=2, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L176] RET assume_abort_if_not(var_1_25 >= -128) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_24=-100, var_1_25=2, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L177] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_24=-100, var_1_25=2, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_24=-100, var_1_25=2, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L177] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_24=-100, var_1_25=2, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L178] CALL assume_abort_if_not(var_1_25 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_24=-100, var_1_25=2, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_24=-100, var_1_25=2, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L178] RET assume_abort_if_not(var_1_25 != 0) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_24=-100, var_1_25=2, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L179] var_1_31 = __VERIFIER_nondet_ulong() [L180] CALL assume_abort_if_not(var_1_31 >= 536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_24=-100, var_1_25=2, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_24=-100, var_1_25=2, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L180] RET assume_abort_if_not(var_1_31 >= 536870912) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_24=-100, var_1_25=2, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L181] CALL assume_abort_if_not(var_1_31 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_24=-100, var_1_25=2, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_24=-100, var_1_25=2, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L181] RET assume_abort_if_not(var_1_31 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_24=-100, var_1_25=2, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L201] RET updateVariables() [L202] CALL step() [L60] unsigned char stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_2=0, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_24=-100, var_1_25=2, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L61] COND FALSE !(var_1_5 && stepLocal_2) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_24=-100, var_1_25=2, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L64] COND FALSE !((var_1_7 - var_1_8) > last_1_var_1_16) [L67] var_1_4 = (last_1_var_1_30 + ((((var_1_10) > (last_1_var_1_24)) ? (var_1_10) : (last_1_var_1_24)))) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_24=-100, var_1_25=2, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=0, var_1_5=0, var_1_6=0] [L70] unsigned char stepLocal_6 = (var_1_12 / var_1_25) != (last_1_var_1_1 * 16); VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_6=1, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_24=-100, var_1_25=2, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=0, var_1_5=0, var_1_6=0] [L71] COND FALSE !(stepLocal_6 && var_1_6) [L78] var_1_26 = last_1_var_1_29 VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_24=-100, var_1_25=2, var_1_26=100, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=0, var_1_5=0, var_1_6=0] [L80] signed long int stepLocal_5 = var_1_20 / var_1_25; VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_5=16384, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_24=-100, var_1_25=2, var_1_26=100, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=0, var_1_5=0, var_1_6=0] [L81] COND TRUE stepLocal_5 > var_1_26 [L82] var_1_24 = var_1_11 VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_24=32766, var_1_25=2, var_1_26=100, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=0, var_1_5=0, var_1_6=0] [L84] unsigned short int stepLocal_7 = var_1_26; VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_7=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_24=32766, var_1_25=2, var_1_26=100, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=0, var_1_5=0, var_1_6=0] [L85] COND TRUE (last_1_var_1_28 + (- var_1_10)) > stepLocal_7 [L86] var_1_28 = (((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) - var_1_26) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_24=32766, var_1_25=2, var_1_26=100, var_1_27=8, var_1_28=-1, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=0, var_1_5=0, var_1_6=0] [L88] signed long int stepLocal_4 = 128; [L89] signed short int stepLocal_3 = var_1_4; VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_3=0, stepLocal_4=128, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32768, var_1_24=32766, var_1_25=2, var_1_26=100, var_1_27=8, var_1_28=-1, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=0, var_1_5=0, var_1_6=0] [L90] COND FALSE !(var_1_26 <= stepLocal_3) [L97] var_1_19 = var_1_22 VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_4=128, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=2, var_1_1=-64, var_1_20=32768, var_1_22=2, var_1_24=32766, var_1_25=2, var_1_26=100, var_1_27=8, var_1_28=-1, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=0, var_1_5=0, var_1_6=0] [L99] COND TRUE (~ var_1_11) >= (~ var_1_20) [L100] var_1_32 = var_1_17 VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_4=128, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-64, var_1_20=32768, var_1_22=2, var_1_24=32766, var_1_25=2, var_1_26=100, var_1_27=8, var_1_28=-1, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=0, var_1_5=0, var_1_6=0] [L102] COND FALSE !(\read(var_1_6)) [L105] var_1_14 = (((((var_1_4) > (var_1_12)) ? (var_1_4) : (var_1_12))) - (last_1_var_1_14 + var_1_26)) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_4=128, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=1000000000, var_1_14=99999999, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-64, var_1_20=32768, var_1_22=2, var_1_24=32766, var_1_25=2, var_1_26=100, var_1_27=8, var_1_28=-1, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=0, var_1_5=0, var_1_6=0] [L107] var_1_13 = (var_1_14 + var_1_12) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_4=128, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=100000098, var_1_14=99999999, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-64, var_1_20=32768, var_1_22=2, var_1_24=32766, var_1_25=2, var_1_26=100, var_1_27=8, var_1_28=-1, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=0, var_1_5=0, var_1_6=0] [L108] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_4=128, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=100000098, var_1_14=99999999, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-64, var_1_20=32768, var_1_22=2, var_1_24=32766, var_1_25=2, var_1_26=100, var_1_27=8, var_1_28=-1, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=0, var_1_5=0, var_1_6=0] [L113] signed long int stepLocal_1 = var_1_14; [L114] signed long int stepLocal_0 = var_1_14; VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=99999999, stepLocal_1=99999999, stepLocal_4=128, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=100000098, var_1_14=99999999, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-64, var_1_20=32768, var_1_22=2, var_1_24=32766, var_1_25=2, var_1_26=100, var_1_27=8, var_1_28=-1, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=0, var_1_5=0, var_1_6=0] [L115] COND FALSE !(! (var_1_14 >= var_1_4)) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=99999999, stepLocal_1=99999999, stepLocal_4=128, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=100000098, var_1_14=99999999, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-64, var_1_20=32768, var_1_22=2, var_1_24=32766, var_1_25=2, var_1_26=100, var_1_27=8, var_1_28=-1, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=0, var_1_5=0, var_1_6=0] [L120] COND FALSE !(var_1_4 >= stepLocal_1) [L123] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=99999999, stepLocal_4=128, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=100000098, var_1_14=99999999, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=0, var_1_20=32768, var_1_22=2, var_1_24=32766, var_1_25=2, var_1_26=100, var_1_27=8, var_1_28=-1, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=0, var_1_5=0, var_1_6=0] [L126] var_1_29 = (var_1_1 + 4u) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=99999999, stepLocal_4=128, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=100000098, var_1_14=99999999, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=0, var_1_20=32768, var_1_22=2, var_1_24=32766, var_1_25=2, var_1_26=100, var_1_27=8, var_1_28=-1, var_1_29=4, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=0, var_1_5=0, var_1_6=0] [L127] COND FALSE !((var_1_28 + (var_1_29 + var_1_26)) < var_1_4) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=99999999, stepLocal_4=128, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=100000098, var_1_14=99999999, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=0, var_1_20=32768, var_1_22=2, var_1_24=32766, var_1_25=2, var_1_26=100, var_1_27=8, var_1_28=-1, var_1_29=4, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=0, var_1_5=0, var_1_6=0] [L130] unsigned long int stepLocal_9 = var_1_20 - ((((var_1_29) > (var_1_12)) ? (var_1_29) : (var_1_12))); [L131] unsigned char stepLocal_8 = var_1_6; VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=99999999, stepLocal_4=128, stepLocal_8=0, stepLocal_9=32669, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=100000098, var_1_14=99999999, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=0, var_1_20=32768, var_1_22=2, var_1_24=32766, var_1_25=2, var_1_26=100, var_1_27=8, var_1_28=-1, var_1_29=4, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=0, var_1_5=0, var_1_6=0] [L132] COND FALSE !(stepLocal_8 || var_1_5) [L139] var_1_30 = ((((var_1_26) > (var_1_29)) ? (var_1_26) : (var_1_29))) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=99999999, stepLocal_4=128, stepLocal_9=32669, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=100000098, var_1_14=99999999, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=0, var_1_20=32768, var_1_22=2, var_1_24=32766, var_1_25=2, var_1_26=100, var_1_27=8, var_1_28=-1, var_1_29=4, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=0, var_1_5=0, var_1_6=0] [L202] RET step() [L203] CALL, EXPR property() [L193-L194] return (((((((((((((! (var_1_14 >= var_1_4)) ? ((256 != var_1_14) ? (var_1_1 == ((signed long int) (var_1_4 + var_1_14))) : 1) : ((var_1_4 >= var_1_14) ? (var_1_1 == ((signed long int) var_1_14)) : (var_1_1 == ((signed long int) var_1_4)))) && ((var_1_5 && var_1_6) ? (var_1_4 == ((signed short int) ((((last_1_var_1_24) < (-100)) ? (last_1_var_1_24) : (-100))))) : (((var_1_7 - var_1_8) > last_1_var_1_16) ? (var_1_4 == ((signed short int) ((((((last_1_var_1_30 - last_1_var_1_24) + var_1_10)) > ((((((var_1_11 - var_1_12)) > (4)) ? ((var_1_11 - var_1_12)) : (4))))) ? (((last_1_var_1_30 - last_1_var_1_24) + var_1_10)) : ((((((var_1_11 - var_1_12)) > (4)) ? ((var_1_11 - var_1_12)) : (4)))))))) : (var_1_4 == ((signed short int) (last_1_var_1_30 + ((((var_1_10) > (last_1_var_1_24)) ? (var_1_10) : (last_1_var_1_24))))))))) && (var_1_13 == ((unsigned long int) (var_1_14 + var_1_12)))) && (var_1_6 ? (var_1_14 == ((signed long int) (var_1_4 - last_1_var_1_14))) : (var_1_14 == ((signed long int) (((((var_1_4) > (var_1_12)) ? (var_1_4) : (var_1_12))) - (last_1_var_1_14 + var_1_26)))))) && (((var_1_28 + (var_1_29 + var_1_26)) < var_1_4) ? (var_1_16 == ((double) ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))))) : 1)) && ((var_1_26 <= var_1_4) ? (((var_1_26 / (var_1_20 - 25)) >= 128) ? (var_1_19 == ((double) (((((15.25 - var_1_21) < 0 ) ? -(15.25 - var_1_21) : (15.25 - var_1_21))) - (var_1_22 + var_1_23)))) : (var_1_19 == ((double) var_1_22))) : (var_1_19 == ((double) var_1_22)))) && (((var_1_20 / var_1_25) > var_1_26) ? (var_1_24 == ((signed short int) var_1_11)) : 1)) && ((((var_1_12 / var_1_25) != (last_1_var_1_1 * 16)) && var_1_6) ? (var_1_6 ? (var_1_26 == ((unsigned short int) var_1_12)) : (var_1_26 == ((unsigned short int) last_1_var_1_29))) : (var_1_26 == ((unsigned short int) last_1_var_1_29)))) && (var_1_5 ? (((var_1_12 * var_1_13) >= var_1_11) ? (var_1_27 == ((unsigned long int) var_1_26)) : 1) : 1)) && (((last_1_var_1_28 + (- var_1_10)) > var_1_26) ? (var_1_28 == ((signed short int) (((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) - var_1_26))) : 1)) && (var_1_29 == ((unsigned long int) (var_1_1 + 4u)))) && ((var_1_6 || var_1_5) ? (((var_1_20 - ((((var_1_29) > (var_1_12)) ? (var_1_29) : (var_1_12)))) >= var_1_11) ? (var_1_30 == ((unsigned long int) var_1_29)) : (var_1_30 == ((unsigned long int) (((((var_1_20) > (var_1_4)) ? (var_1_20) : (var_1_4))) + ((1000000000u + var_1_31) - var_1_29))))) : (var_1_30 == ((unsigned long int) ((((var_1_26) > (var_1_29)) ? (var_1_26) : (var_1_29))))))) && (((~ var_1_11) >= (~ var_1_20)) ? (var_1_32 == ((double) var_1_17)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=100000098, var_1_14=99999999, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=0, var_1_20=32768, var_1_22=2, var_1_24=32766, var_1_25=2, var_1_26=100, var_1_27=8, var_1_28=-1, var_1_29=4, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=0, var_1_5=0, var_1_6=0] [L203] RET, EXPR property() [L203] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=100000098, var_1_14=99999999, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=0, var_1_20=32768, var_1_22=2, var_1_24=32766, var_1_25=2, var_1_26=100, var_1_27=8, var_1_28=-1, var_1_29=4, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=0, var_1_5=0, var_1_6=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-199, var_1_11=32766, var_1_12=99, var_1_13=100000098, var_1_14=99999999, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=0, var_1_20=32768, var_1_22=2, var_1_24=32766, var_1_25=2, var_1_26=100, var_1_27=8, var_1_28=-1, var_1_29=4, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=0, var_1_5=0, var_1_6=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 9, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1165 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1165 mSDsluCounter, 3456 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2301 mSDsCounter, 419 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1275 IncrementalHoareTripleChecker+Invalid, 1694 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 419 mSolverCounterUnsat, 1155 mSDtfsCounter, 1275 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 476 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=381occurred in iteration=8, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 512 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 1648 NumberOfCodeBlocks, 1648 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1310 ConstructedInterpolants, 0 QuantifiedInterpolants, 8289 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 8832/8832 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 08:08:00,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-25.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 c147c84511e5c0677a9069c27a4d754d19564d6e4b1f08886ba1a76b5d6b51d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:08:03,413 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:08:03,540 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 08:08:03,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:08:03,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:08:03,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:08:03,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:08:03,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:08:03,570 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:08:03,570 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:08:03,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:08:03,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:08:03,571 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:08:03,571 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:08:03,571 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:08:03,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:08:03,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:08:03,572 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:08:03,572 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:08:03,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:08:03,572 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:08:03,572 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:08:03,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:08:03,573 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 08:08:03,573 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 08:08:03,573 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:08:03,573 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 08:08:03,573 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:08:03,573 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:08:03,573 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:08:03,574 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:08:03,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:08:03,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:08:03,574 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:08:03,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:08:03,574 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:08:03,574 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:08:03,575 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:08:03,575 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 08:08:03,575 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 08:08:03,575 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:08:03,575 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:08:03,575 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:08:03,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:08:03,575 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 -> c147c84511e5c0677a9069c27a4d754d19564d6e4b1f08886ba1a76b5d6b51d6 [2024-11-07 08:08:03,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:08:03,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:08:03,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:08:03,879 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:08:03,880 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:08:03,882 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-25.i [2024-11-07 08:08:05,349 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:08:05,590 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:08:05,590 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-25.i [2024-11-07 08:08:05,606 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a0feed5f/dc509f12231b41bfad22ce79cbcb35c1/FLAG5ba51023e [2024-11-07 08:08:05,618 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a0feed5f/dc509f12231b41bfad22ce79cbcb35c1 [2024-11-07 08:08:05,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:08:05,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:08:05,623 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:08:05,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:08:05,626 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:08:05,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:08:05" (1/1) ... [2024-11-07 08:08:05,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@193e3796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:08:05, skipping insertion in model container [2024-11-07 08:08:05,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:08:05" (1/1) ... [2024-11-07 08:08:05,649 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:08:05,785 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-25.i[916,929] [2024-11-07 08:08:05,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:08:05,921 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:08:05,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_loopvsstraightlinecode_100-while_file-25.i[916,929] [2024-11-07 08:08:05,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:08:06,021 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:08:06,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:08:06 WrapperNode [2024-11-07 08:08:06,022 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:08:06,023 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:08:06,024 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:08:06,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:08:06,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:08:06" (1/1) ... [2024-11-07 08:08:06,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:08:06" (1/1) ... [2024-11-07 08:08:06,090 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2024-11-07 08:08:06,091 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:08:06,092 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:08:06,092 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:08:06,092 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:08:06,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:08:06" (1/1) ... [2024-11-07 08:08:06,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:08:06" (1/1) ... [2024-11-07 08:08:06,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:08:06" (1/1) ... [2024-11-07 08:08:06,138 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 08:08:06,138 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:08:06" (1/1) ... [2024-11-07 08:08:06,138 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:08:06" (1/1) ... [2024-11-07 08:08:06,156 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:08:06" (1/1) ... [2024-11-07 08:08:06,162 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:08:06" (1/1) ... [2024-11-07 08:08:06,170 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:08:06" (1/1) ... [2024-11-07 08:08:06,175 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:08:06" (1/1) ... [2024-11-07 08:08:06,179 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:08:06,180 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:08:06,183 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:08:06,183 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:08:06,184 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:08:06" (1/1) ... [2024-11-07 08:08:06,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:08:06,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:08:06,223 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 08:08:06,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 08:08:06,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:08:06,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 08:08:06,254 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:08:06,254 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:08:06,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:08:06,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:08:06,371 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:08:06,373 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:08:13,070 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-07 08:08:13,070 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:08:13,084 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:08:13,086 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:08:13,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:08:13 BoogieIcfgContainer [2024-11-07 08:08:13,087 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:08:13,089 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:08:13,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:08:13,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:08:13,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:08:05" (1/3) ... [2024-11-07 08:08:13,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497192bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:08:13, skipping insertion in model container [2024-11-07 08:08:13,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:08:06" (2/3) ... [2024-11-07 08:08:13,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497192bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:08:13, skipping insertion in model container [2024-11-07 08:08:13,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:08:13" (3/3) ... [2024-11-07 08:08:13,097 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-25.i [2024-11-07 08:08:13,113 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:08:13,114 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:08:13,161 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:08:13,174 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;@7b10a21a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:08:13,175 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:08:13,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 58 states have internal predecessors, (80), 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 08:08:13,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-07 08:08:13,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:08:13,197 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:08:13,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:08:13,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:08:13,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1261889, now seen corresponding path program 1 times [2024-11-07 08:08:13,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:08:13,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5396266] [2024-11-07 08:08:13,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:08:13,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:08:13,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:08:13,229 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:08:13,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 08:08:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:08:13,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 08:08:13,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:08:13,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 406 proven. 0 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2024-11-07 08:08:13,883 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:08:13,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:08:13,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5396266] [2024-11-07 08:08:13,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [5396266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:08:13,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:08:13,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:08:13,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159344579] [2024-11-07 08:08:13,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:08:13,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:08:13,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:08:13,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:08:13,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:08:13,914 INFO L87 Difference]: Start difference. First operand has 84 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 58 states have internal predecessors, (80), 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 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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 08:08:13,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:08:13,949 INFO L93 Difference]: Finished difference Result 161 states and 274 transitions. [2024-11-07 08:08:13,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:08:13,952 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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 164 [2024-11-07 08:08:13,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:08:13,959 INFO L225 Difference]: With dead ends: 161 [2024-11-07 08:08:13,959 INFO L226 Difference]: Without dead ends: 80 [2024-11-07 08:08:13,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:08:13,969 INFO L432 NwaCegarLoop]: 121 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, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:08:13,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:08:13,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-07 08:08:14,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-07 08:08:14,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 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 08:08:14,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 121 transitions. [2024-11-07 08:08:14,019 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 121 transitions. Word has length 164 [2024-11-07 08:08:14,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:08:14,019 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 121 transitions. [2024-11-07 08:08:14,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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 08:08:14,020 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 121 transitions. [2024-11-07 08:08:14,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-07 08:08:14,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:08:14,025 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:08:14,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 08:08:14,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:08:14,228 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:08:14,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:08:14,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1353077193, now seen corresponding path program 1 times [2024-11-07 08:08:14,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:08:14,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947984173] [2024-11-07 08:08:14,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:08:14,230 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:08:14,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:08:14,233 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:08:14,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 08:08:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:08:14,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 08:08:14,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:08:15,066 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 08:08:15,067 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:08:15,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:08:15,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947984173] [2024-11-07 08:08:15,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947984173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:08:15,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:08:15,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:08:15,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731055405] [2024-11-07 08:08:15,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:08:15,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:08:15,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:08:15,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:08:15,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:08:15,074 INFO L87 Difference]: Start difference. First operand 80 states and 121 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 08:08:19,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 08:08:22,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 08:08:22,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:08:22,619 INFO L93 Difference]: Finished difference Result 188 states and 285 transitions. [2024-11-07 08:08:22,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:08:22,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 164 [2024-11-07 08:08:22,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:08:22,674 INFO L225 Difference]: With dead ends: 188 [2024-11-07 08:08:22,674 INFO L226 Difference]: Without dead ends: 111 [2024-11-07 08:08:22,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 162 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 08:08:22,677 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 36 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-11-07 08:08:22,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 230 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 1 Unknown, 0 Unchecked, 7.5s Time] [2024-11-07 08:08:22,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-07 08:08:22,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2024-11-07 08:08:22,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 76 states have internal predecessors, (107), 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 08:08:22,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2024-11-07 08:08:22,699 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 155 transitions. Word has length 164 [2024-11-07 08:08:22,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:08:22,704 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 155 transitions. [2024-11-07 08:08:22,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 08:08:22,704 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 155 transitions. [2024-11-07 08:08:22,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 08:08:22,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:08:22,708 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:08:22,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 08:08:22,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:08:22,909 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:08:22,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:08:22,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1146571696, now seen corresponding path program 1 times [2024-11-07 08:08:22,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:08:22,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309471470] [2024-11-07 08:08:22,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:08:22,911 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:08:22,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:08:22,914 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:08:22,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 08:08:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:08:23,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 08:08:23,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:08:25,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 269 proven. 60 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2024-11-07 08:08:25,922 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:08:26,793 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 08:08:26,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:08:26,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309471470] [2024-11-07 08:08:26,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309471470] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 08:08:26,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 08:08:26,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-07 08:08:26,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858987316] [2024-11-07 08:08:26,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:08:26,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:08:26,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:08:26,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:08:26,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 08:08:26,795 INFO L87 Difference]: Start difference. First operand 102 states and 155 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 08:08:31,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 08:08:34,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 08:08:34,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:08:34,382 INFO L93 Difference]: Finished difference Result 256 states and 387 transitions. [2024-11-07 08:08:34,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:08:34,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 165 [2024-11-07 08:08:34,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:08:34,430 INFO L225 Difference]: With dead ends: 256 [2024-11-07 08:08:34,430 INFO L226 Difference]: Without dead ends: 157 [2024-11-07 08:08:34,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-07 08:08:34,431 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 43 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-11-07 08:08:34,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 373 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 1 Unknown, 0 Unchecked, 7.5s Time] [2024-11-07 08:08:34,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-07 08:08:34,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 146. [2024-11-07 08:08:34,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 118 states have internal predecessors, (164), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 08:08:34,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 216 transitions. [2024-11-07 08:08:34,454 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 216 transitions. Word has length 165 [2024-11-07 08:08:34,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:08:34,455 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 216 transitions. [2024-11-07 08:08:34,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 08:08:34,456 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 216 transitions. [2024-11-07 08:08:34,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 08:08:34,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:08:34,458 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:08:34,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 08:08:34,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:08:34,659 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:08:34,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:08:34,660 INFO L85 PathProgramCache]: Analyzing trace with hash 2137278350, now seen corresponding path program 1 times [2024-11-07 08:08:34,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:08:34,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902318738] [2024-11-07 08:08:34,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:08:34,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:08:34,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:08:34,665 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:08:34,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 08:08:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:08:35,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 08:08:35,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:08:51,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 624 proven. 87 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2024-11-07 08:08:51,603 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:09:02,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:09:02,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902318738] [2024-11-07 08:09:02,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902318738] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:09:02,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2016006714] [2024-11-07 08:09:02,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:09:02,281 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 08:09:02,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 08:09:02,285 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 08:09:02,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-07 08:09:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:09:04,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 08:09:04,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:09:08,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-11-07 08:09:08,454 INFO L311 TraceCheckSpWp]: Computing backward predicates...