./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.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', 'fc4d323dccf5c6cb2dd33d7a9917b9da8c0abdef12ff69acd362adea0abef7c3'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.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 fc4d323dccf5c6cb2dd33d7a9917b9da8c0abdef12ff69acd362adea0abef7c3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:14:28,644 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:14:28,747 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 05:14:28,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:14:28,751 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:14:28,776 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:14:28,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:14:28,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:14:28,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:14:28,780 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:14:28,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:14:28,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:14:28,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:14:28,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:14:28,782 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:14:28,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:14:28,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:14:28,782 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:14:28,782 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 05:14:28,782 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:14:28,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:14:28,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:14:28,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:14:28,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:14:28,782 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:14:28,783 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:14:28,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:14:28,783 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:14:28,783 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:14:28,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:14:28,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:14:28,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:14:28,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:14:28,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:14:28,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:14:28,784 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:14:28,784 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 05:14:28,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 05:14:28,785 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:14:28,785 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:14:28,785 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:14:28,785 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:14:28,785 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 -> fc4d323dccf5c6cb2dd33d7a9917b9da8c0abdef12ff69acd362adea0abef7c3 [2024-11-07 05:14:29,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:14:29,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:14:29,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:14:29,059 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:14:29,060 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:14:29,062 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i [2024-11-07 05:14:30,387 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:14:30,676 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:14:30,677 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i [2024-11-07 05:14:30,687 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/514ea2796/e391d3713bdd47178a1ab0fe81c7c6ca/FLAG1239bd2a4 [2024-11-07 05:14:31,014 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/514ea2796/e391d3713bdd47178a1ab0fe81c7c6ca [2024-11-07 05:14:31,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:14:31,017 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:14:31,018 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:14:31,018 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:14:31,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:14:31,021 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:14:31" (1/1) ... [2024-11-07 05:14:31,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@638ecd1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:14:31, skipping insertion in model container [2024-11-07 05:14:31,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:14:31" (1/1) ... [2024-11-07 05:14:31,033 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:14:31,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i[915,928] [2024-11-07 05:14:31,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:14:31,242 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:14:31,255 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i[915,928] [2024-11-07 05:14:31,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:14:31,314 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:14:31,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:14:31 WrapperNode [2024-11-07 05:14:31,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:14:31,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:14:31,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:14:31,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:14:31,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:14:31" (1/1) ... [2024-11-07 05:14:31,331 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:14:31" (1/1) ... [2024-11-07 05:14:31,365 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 241 [2024-11-07 05:14:31,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:14:31,366 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:14:31,366 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:14:31,366 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:14:31,374 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:14:31" (1/1) ... [2024-11-07 05:14:31,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:14:31" (1/1) ... [2024-11-07 05:14:31,376 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:14:31" (1/1) ... [2024-11-07 05:14:31,394 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 05:14:31,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:14:31" (1/1) ... [2024-11-07 05:14:31,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:14:31" (1/1) ... [2024-11-07 05:14:31,410 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:14:31" (1/1) ... [2024-11-07 05:14:31,417 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:14:31" (1/1) ... [2024-11-07 05:14:31,418 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:14:31" (1/1) ... [2024-11-07 05:14:31,419 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:14:31" (1/1) ... [2024-11-07 05:14:31,424 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:14:31,424 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:14:31,424 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:14:31,424 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:14:31,425 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:14:31" (1/1) ... [2024-11-07 05:14:31,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:14:31,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:14:31,465 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 05:14:31,473 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 05:14:31,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:14:31,491 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:14:31,491 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:14:31,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 05:14:31,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:14:31,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:14:31,583 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:14:31,584 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:14:32,003 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 05:14:32,003 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:14:32,016 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:14:32,016 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:14:32,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:14:32 BoogieIcfgContainer [2024-11-07 05:14:32,017 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:14:32,019 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:14:32,019 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:14:32,027 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:14:32,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:14:31" (1/3) ... [2024-11-07 05:14:32,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ab390b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:14:32, skipping insertion in model container [2024-11-07 05:14:32,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:14:31" (2/3) ... [2024-11-07 05:14:32,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ab390b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:14:32, skipping insertion in model container [2024-11-07 05:14:32,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:14:32" (3/3) ... [2024-11-07 05:14:32,029 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-30.i [2024-11-07 05:14:32,042 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:14:32,042 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:14:32,077 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:14:32,086 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;@4eccfca0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:14:32,086 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:14:32,090 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 69 states have (on average 1.4202898550724639) internal successors, (98), 70 states have internal predecessors, (98), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-07 05:14:32,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 05:14:32,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:14:32,100 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:14:32,100 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:14:32,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:14:32,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1142265668, now seen corresponding path program 1 times [2024-11-07 05:14:32,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:14:32,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577791227] [2024-11-07 05:14:32,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:14:32,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:14:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:14:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:14:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:14:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 05:14:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 05:14:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 05:14:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 05:14:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:14:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:14:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:14:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:14:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 05:14:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 05:14:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 05:14:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 05:14:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 05:14:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 05:14:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 05:14:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 05:14:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 05:14:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 05:14:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 05:14:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 05:14:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-07 05:14:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 05:14:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-07 05:14:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 05:14:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-07 05:14:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 05:14:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-07 05:14:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 05:14:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-07 05:14:32,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:14:32,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577791227] [2024-11-07 05:14:32,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577791227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:14:32,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:14:32,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:14:32,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264564112] [2024-11-07 05:14:32,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:14:32,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:14:32,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:14:32,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:14:32,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:14:32,438 INFO L87 Difference]: Start difference. First operand has 103 states, 69 states have (on average 1.4202898550724639) internal successors, (98), 70 states have internal predecessors, (98), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-07 05:14:32,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:14:32,471 INFO L93 Difference]: Finished difference Result 199 states and 345 transitions. [2024-11-07 05:14:32,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:14:32,473 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 203 [2024-11-07 05:14:32,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:14:32,479 INFO L225 Difference]: With dead ends: 199 [2024-11-07 05:14:32,479 INFO L226 Difference]: Without dead ends: 99 [2024-11-07 05:14:32,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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 05:14:32,488 INFO L432 NwaCegarLoop]: 153 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, 153 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 05:14:32,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:14:32,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-07 05:14:32,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-07 05:14:32,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 66 states have (on average 1.378787878787879) internal successors, (91), 66 states have internal predecessors, (91), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-07 05:14:32,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 153 transitions. [2024-11-07 05:14:32,521 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 153 transitions. Word has length 203 [2024-11-07 05:14:32,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:14:32,522 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 153 transitions. [2024-11-07 05:14:32,522 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-07 05:14:32,522 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 153 transitions. [2024-11-07 05:14:32,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 05:14:32,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:14:32,525 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:14:32,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 05:14:32,525 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:14:32,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:14:32,526 INFO L85 PathProgramCache]: Analyzing trace with hash -157721322, now seen corresponding path program 1 times [2024-11-07 05:14:32,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:14:32,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117717353] [2024-11-07 05:14:32,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:14:32,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:14:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:14:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:14:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:14:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 05:14:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 05:14:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 05:14:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 05:14:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:14:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:14:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:14:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:14:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 05:14:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 05:14:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 05:14:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 05:14:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 05:14:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 05:14:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 05:14:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 05:14:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 05:14:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 05:14:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 05:14:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 05:14:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-07 05:14:32,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 05:14:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-07 05:14:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 05:14:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-07 05:14:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 05:14:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-07 05:14:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 05:14:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:32,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-07 05:14:32,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:14:32,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117717353] [2024-11-07 05:14:32,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117717353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:14:32,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:14:32,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:14:32,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829347317] [2024-11-07 05:14:32,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:14:32,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:14:32,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:14:32,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:14:32,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:14:32,814 INFO L87 Difference]: Start difference. First operand 99 states and 153 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 05:14:32,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:14:32,863 INFO L93 Difference]: Finished difference Result 261 states and 403 transitions. [2024-11-07 05:14:32,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:14:32,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2024-11-07 05:14:32,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:14:32,869 INFO L225 Difference]: With dead ends: 261 [2024-11-07 05:14:32,869 INFO L226 Difference]: Without dead ends: 165 [2024-11-07 05:14:32,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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 05:14:32,870 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 100 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:14:32,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 296 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:14:32,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-07 05:14:32,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2024-11-07 05:14:32,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 113 states have internal predecessors, (156), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-07 05:14:32,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 250 transitions. [2024-11-07 05:14:32,902 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 250 transitions. Word has length 203 [2024-11-07 05:14:32,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:14:32,921 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 250 transitions. [2024-11-07 05:14:32,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 05:14:32,922 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 250 transitions. [2024-11-07 05:14:32,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 05:14:32,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:14:32,924 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:14:32,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 05:14:32,924 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:14:32,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:14:32,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2143101268, now seen corresponding path program 1 times [2024-11-07 05:14:32,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:14:32,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479180682] [2024-11-07 05:14:32,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:14:32,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:14:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:14:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:14:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:14:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 05:14:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 05:14:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 05:14:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 05:14:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:14:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:14:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:14:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:14:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 05:14:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 05:14:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 05:14:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 05:14:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 05:14:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 05:14:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 05:14:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 05:14:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 05:14:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 05:14:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 05:14:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 05:14:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-07 05:14:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 05:14:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-07 05:14:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 05:14:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-07 05:14:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 05:14:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-07 05:14:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 05:14:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:33,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-07 05:14:33,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:14:33,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479180682] [2024-11-07 05:14:33,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479180682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:14:33,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:14:33,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 05:14:33,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380224556] [2024-11-07 05:14:33,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:14:33,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 05:14:33,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:14:33,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 05:14:33,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:14:33,503 INFO L87 Difference]: Start difference. First operand 162 states and 250 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 05:14:33,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:14:33,763 INFO L93 Difference]: Finished difference Result 532 states and 827 transitions. [2024-11-07 05:14:33,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 05:14:33,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2024-11-07 05:14:33,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:14:33,770 INFO L225 Difference]: With dead ends: 532 [2024-11-07 05:14:33,774 INFO L226 Difference]: Without dead ends: 373 [2024-11-07 05:14:33,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:14:33,778 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 144 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:14:33,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 473 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:14:33,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-07 05:14:33,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 319. [2024-11-07 05:14:33,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 220 states have (on average 1.3727272727272728) internal successors, (302), 222 states have internal predecessors, (302), 94 states have call successors, (94), 4 states have call predecessors, (94), 4 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-07 05:14:33,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 490 transitions. [2024-11-07 05:14:33,858 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 490 transitions. Word has length 203 [2024-11-07 05:14:33,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:14:33,859 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 490 transitions. [2024-11-07 05:14:33,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 05:14:33,860 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 490 transitions. [2024-11-07 05:14:33,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-07 05:14:33,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:14:33,867 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:14:33,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 05:14:33,867 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:14:33,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:14:33,868 INFO L85 PathProgramCache]: Analyzing trace with hash -989976279, now seen corresponding path program 1 times [2024-11-07 05:14:33,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:14:33,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756928559] [2024-11-07 05:14:33,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:14:33,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:14:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:14:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:14:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:14:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 05:14:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 05:14:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 05:14:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 05:14:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:14:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:14:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:14:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:14:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 05:14:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 05:14:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 05:14:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 05:14:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 05:14:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 05:14:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 05:14:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 05:14:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 05:14:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 05:14:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 05:14:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 05:14:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-07 05:14:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 05:14:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-07 05:14:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 05:14:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-07 05:14:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 05:14:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-07 05:14:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 05:14:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-07 05:14:34,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:14:34,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756928559] [2024-11-07 05:14:34,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756928559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:14:34,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:14:34,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 05:14:34,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778330433] [2024-11-07 05:14:34,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:14:34,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 05:14:34,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:14:34,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 05:14:34,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:14:34,149 INFO L87 Difference]: Start difference. First operand 319 states and 490 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 05:14:34,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:14:34,339 INFO L93 Difference]: Finished difference Result 955 states and 1472 transitions. [2024-11-07 05:14:34,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 05:14:34,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204 [2024-11-07 05:14:34,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:14:34,349 INFO L225 Difference]: With dead ends: 955 [2024-11-07 05:14:34,349 INFO L226 Difference]: Without dead ends: 639 [2024-11-07 05:14:34,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 63 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 05:14:34,355 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 81 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 05:14:34,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 354 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 05:14:34,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-11-07 05:14:34,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 637. [2024-11-07 05:14:34,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 440 states have (on average 1.3636363636363635) internal successors, (600), 444 states have internal predecessors, (600), 188 states have call successors, (188), 8 states have call predecessors, (188), 8 states have return successors, (188), 184 states have call predecessors, (188), 188 states have call successors, (188) [2024-11-07 05:14:34,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 976 transitions. [2024-11-07 05:14:34,492 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 976 transitions. Word has length 204 [2024-11-07 05:14:34,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:14:34,492 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 976 transitions. [2024-11-07 05:14:34,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 05:14:34,493 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 976 transitions. [2024-11-07 05:14:34,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-07 05:14:34,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:14:34,496 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:14:34,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 05:14:34,497 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:14:34,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:14:34,497 INFO L85 PathProgramCache]: Analyzing trace with hash 31092075, now seen corresponding path program 1 times [2024-11-07 05:14:34,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:14:34,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443428875] [2024-11-07 05:14:34,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:14:34,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:14:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:14:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:14:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:14:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 05:14:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 05:14:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 05:14:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 05:14:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:14:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:14:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:14:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:14:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 05:14:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 05:14:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 05:14:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 05:14:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 05:14:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 05:14:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 05:14:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 05:14:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 05:14:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 05:14:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 05:14:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 05:14:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-07 05:14:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 05:14:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-07 05:14:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 05:14:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-07 05:14:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 05:14:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-07 05:14:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 05:14:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:34,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-07 05:14:34,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:14:34,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443428875] [2024-11-07 05:14:34,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443428875] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:14:34,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416440178] [2024-11-07 05:14:34,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:14:34,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:14:34,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:14:34,988 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 05:14:34,990 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 05:14:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:35,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 05:14:35,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:14:35,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 62 proven. 174 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 05:14:35,647 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:14:35,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-07 05:14:35,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416440178] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:14:35,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 05:14:35,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2024-11-07 05:14:35,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405758134] [2024-11-07 05:14:35,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 05:14:35,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 05:14:35,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:14:35,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 05:14:35,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-07 05:14:35,986 INFO L87 Difference]: Start difference. First operand 637 states and 976 transitions. Second operand has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 3 states have call successors, (61), 3 states have call predecessors, (61), 5 states have return successors, (62), 2 states have call predecessors, (62), 3 states have call successors, (62) [2024-11-07 05:14:36,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:14:36,335 INFO L93 Difference]: Finished difference Result 1137 states and 1696 transitions. [2024-11-07 05:14:36,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 05:14:36,336 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 3 states have call successors, (61), 3 states have call predecessors, (61), 5 states have return successors, (62), 2 states have call predecessors, (62), 3 states have call successors, (62) Word has length 204 [2024-11-07 05:14:36,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:14:36,342 INFO L225 Difference]: With dead ends: 1137 [2024-11-07 05:14:36,342 INFO L226 Difference]: Without dead ends: 819 [2024-11-07 05:14:36,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 464 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2024-11-07 05:14:36,345 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 354 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:14:36,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 375 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:14:36,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2024-11-07 05:14:36,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 701. [2024-11-07 05:14:36,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 488 states have (on average 1.3114754098360655) internal successors, (640), 492 states have internal predecessors, (640), 188 states have call successors, (188), 24 states have call predecessors, (188), 24 states have return successors, (188), 184 states have call predecessors, (188), 188 states have call successors, (188) [2024-11-07 05:14:36,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1016 transitions. [2024-11-07 05:14:36,438 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1016 transitions. Word has length 204 [2024-11-07 05:14:36,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:14:36,439 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 1016 transitions. [2024-11-07 05:14:36,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 3 states have call successors, (61), 3 states have call predecessors, (61), 5 states have return successors, (62), 2 states have call predecessors, (62), 3 states have call successors, (62) [2024-11-07 05:14:36,439 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1016 transitions. [2024-11-07 05:14:36,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-07 05:14:36,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:14:36,442 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:14:36,463 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 05:14:36,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:14:36,643 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:14:36,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:14:36,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1120915974, now seen corresponding path program 1 times [2024-11-07 05:14:36,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:14:36,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575444551] [2024-11-07 05:14:36,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:14:36,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:14:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:14:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:14:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:14:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 05:14:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 05:14:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 05:14:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 05:14:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:14:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:14:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:14:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:14:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 05:14:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 05:14:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 05:14:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 05:14:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 05:14:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 05:14:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 05:14:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 05:14:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 05:14:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 05:14:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 05:14:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 05:14:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-07 05:14:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 05:14:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-07 05:14:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 05:14:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-07 05:14:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 05:14:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-07 05:14:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 05:14:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:36,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-07 05:14:36,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:14:36,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575444551] [2024-11-07 05:14:36,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575444551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:14:36,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:14:36,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:14:36,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975040348] [2024-11-07 05:14:36,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:14:36,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:14:36,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:14:36,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:14:36,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:14:36,792 INFO L87 Difference]: Start difference. First operand 701 states and 1016 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 05:14:36,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:14:36,868 INFO L93 Difference]: Finished difference Result 1399 states and 2029 transitions. [2024-11-07 05:14:36,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:14:36,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2024-11-07 05:14:36,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:14:36,875 INFO L225 Difference]: With dead ends: 1399 [2024-11-07 05:14:36,875 INFO L226 Difference]: Without dead ends: 701 [2024-11-07 05:14:36,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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 05:14:36,878 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:14:36,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 275 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:14:36,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-11-07 05:14:36,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 701. [2024-11-07 05:14:36,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 488 states have (on average 1.2950819672131149) internal successors, (632), 492 states have internal predecessors, (632), 188 states have call successors, (188), 24 states have call predecessors, (188), 24 states have return successors, (188), 184 states have call predecessors, (188), 188 states have call successors, (188) [2024-11-07 05:14:36,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1008 transitions. [2024-11-07 05:14:36,984 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1008 transitions. Word has length 205 [2024-11-07 05:14:36,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:14:36,985 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 1008 transitions. [2024-11-07 05:14:36,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 05:14:36,985 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1008 transitions. [2024-11-07 05:14:36,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-07 05:14:36,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:14:36,988 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:14:36,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 05:14:36,988 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:14:36,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:14:36,989 INFO L85 PathProgramCache]: Analyzing trace with hash -584291466, now seen corresponding path program 1 times [2024-11-07 05:14:36,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:14:36,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589273544] [2024-11-07 05:14:36,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:14:36,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:14:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 05:14:37,053 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 05:14:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 05:14:37,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 05:14:37,151 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 05:14:37,152 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 05:14:37,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 05:14:37,155 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:14:37,263 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 05:14:37,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:14:37 BoogieIcfgContainer [2024-11-07 05:14:37,266 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 05:14:37,267 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 05:14:37,267 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 05:14:37,267 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 05:14:37,268 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:14:32" (3/4) ... [2024-11-07 05:14:37,270 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 05:14:37,270 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 05:14:37,271 INFO L158 Benchmark]: Toolchain (without parser) took 6254.04ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 117.2MB in the beginning and 99.1MB in the end (delta: 18.1MB). Peak memory consumption was 95.7MB. Max. memory is 16.1GB. [2024-11-07 05:14:37,272 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:14:37,272 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.67ms. Allocated memory is still 142.6MB. Free memory was 117.0MB in the beginning and 102.0MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 05:14:37,272 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.56ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 99.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:14:37,272 INFO L158 Benchmark]: Boogie Preprocessor took 57.59ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 96.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:14:37,272 INFO L158 Benchmark]: RCFGBuilder took 592.36ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 72.7MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 05:14:37,273 INFO L158 Benchmark]: TraceAbstraction took 5247.01ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 72.0MB in the beginning and 99.2MB in the end (delta: -27.1MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. [2024-11-07 05:14:37,273 INFO L158 Benchmark]: Witness Printer took 3.70ms. Allocated memory is still 218.1MB. Free memory was 99.2MB in the beginning and 99.1MB in the end (delta: 63.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:14:37,274 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.47ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.67ms. Allocated memory is still 142.6MB. Free memory was 117.0MB in the beginning and 102.0MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.56ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 99.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.59ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 96.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 592.36ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 72.7MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5247.01ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 72.0MB in the beginning and 99.2MB in the end (delta: -27.1MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. * Witness Printer took 3.70ms. Allocated memory is still 218.1MB. Free memory was 99.2MB in the beginning and 99.1MB in the end (delta: 63.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 180, overapproximation of someUnaryDOUBLEoperation at line 39, overapproximation of someBinaryArithmeticDOUBLEoperation at line 113, overapproximation of someBinaryDOUBLEComparisonOperation at line 189. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] double var_1_5 = 127.5; [L25] double var_1_7 = 10000000000000.125; [L26] double var_1_8 = 1.25; [L27] double var_1_10 = 25.7; [L28] signed long int var_1_11 = -2; [L29] signed long int var_1_13 = 5; [L30] signed long int var_1_14 = 128; [L31] signed long int var_1_15 = 1000; [L32] double var_1_16 = 0.2; [L33] double var_1_17 = 0.25; [L34] double var_1_18 = 99999999999999.5; [L35] signed short int var_1_19 = -64; [L36] double var_1_20 = 256.75; [L37] double var_1_21 = 100.4; [L38] double var_1_22 = 4.5; [L39] double var_1_23 = -0.5; [L40] signed long int var_1_24 = 10; [L41] signed char var_1_25 = -8; [L42] signed char var_1_26 = 32; [L43] unsigned long int var_1_27 = 64; [L44] unsigned char var_1_28 = 0; [L45] unsigned long int var_1_29 = 32; [L46] unsigned char var_1_30 = 10; [L47] unsigned char var_1_31 = 10; [L48] unsigned char var_1_32 = 32; [L49] unsigned char var_1_33 = 5; [L50] unsigned char var_1_34 = 8; [L51] unsigned char var_1_35 = 128; [L52] float var_1_36 = 7.5; [L53] float var_1_37 = 2.5; [L54] unsigned char last_1_var_1_1 = 1; [L55] signed long int last_1_var_1_11 = -2; [L56] signed long int last_1_var_1_15 = 1000; [L57] double last_1_var_1_16 = 0.2; VAL [isInitial=0, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=0, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L193] isInitial = 1 [L194] FCALL initially() [L195] COND TRUE 1 [L196] CALL updateLastVariables() [L183] last_1_var_1_1 = var_1_1 [L184] last_1_var_1_11 = var_1_11 [L185] last_1_var_1_15 = var_1_15 [L186] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=0, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L196] RET updateLastVariables() [L197] CALL updateVariables() [L130] var_1_4 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L131] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L132] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L132] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L133] var_1_7 = __VERIFIER_nondet_double() [L134] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L134] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L135] var_1_10 = __VERIFIER_nondet_double() [L136] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L136] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L137] var_1_13 = __VERIFIER_nondet_long() [L138] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L138] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L139] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L139] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L140] var_1_14 = __VERIFIER_nondet_long() [L141] CALL assume_abort_if_not(var_1_14 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L141] RET assume_abort_if_not(var_1_14 >= -2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L142] CALL assume_abort_if_not(var_1_14 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L142] RET assume_abort_if_not(var_1_14 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L143] var_1_17 = __VERIFIER_nondet_double() [L144] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L144] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L145] var_1_18 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L146] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L147] var_1_20 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_20 >= -922337.2036854776000e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L148] RET assume_abort_if_not((var_1_20 >= -922337.2036854776000e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L149] var_1_21 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L150] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L151] var_1_22 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L152] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L153] var_1_23 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_23 >= -922337.2036854776000e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854776000e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L154] RET assume_abort_if_not((var_1_23 >= -922337.2036854776000e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854776000e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L155] var_1_26 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_26 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L156] RET assume_abort_if_not(var_1_26 >= -127) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L157] CALL assume_abort_if_not(var_1_26 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L157] RET assume_abort_if_not(var_1_26 <= 126) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L158] var_1_28 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L159] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L160] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L160] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L161] var_1_29 = __VERIFIER_nondet_ulong() [L162] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L162] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L163] CALL assume_abort_if_not(var_1_29 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L163] RET assume_abort_if_not(var_1_29 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L164] var_1_31 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L165] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L166] CALL assume_abort_if_not(var_1_31 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L166] RET assume_abort_if_not(var_1_31 <= 64) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L167] var_1_32 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L168] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L169] CALL assume_abort_if_not(var_1_32 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L169] RET assume_abort_if_not(var_1_32 <= 63) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L170] var_1_33 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L171] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L172] CALL assume_abort_if_not(var_1_33 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L172] RET assume_abort_if_not(var_1_33 <= 127) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L173] var_1_34 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=127, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=127, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L174] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=127, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L175] CALL assume_abort_if_not(var_1_34 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L175] RET assume_abort_if_not(var_1_34 <= 127) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L176] var_1_35 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_35 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L177] RET assume_abort_if_not(var_1_35 >= 127) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L178] CALL assume_abort_if_not(var_1_35 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L178] RET assume_abort_if_not(var_1_35 <= 254) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L179] var_1_37 = __VERIFIER_nondet_float() [L180] CALL assume_abort_if_not((var_1_37 >= -922337.2036854765600e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L180] RET assume_abort_if_not((var_1_37 >= -922337.2036854765600e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L197] RET updateVariables() [L198] CALL step() [L61] COND TRUE (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) - var_1_21) == (var_1_22 * var_1_23) [L62] var_1_19 = -4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L64] var_1_24 = var_1_19 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L65] COND TRUE var_1_20 <= var_1_22 [L66] var_1_25 = var_1_26 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L68] EXPR var_1_25 | var_1_19 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L68] COND FALSE !((var_1_26 <= (var_1_25 | var_1_19)) || var_1_28) [L71] COND FALSE !(\read(var_1_28)) [L74] var_1_30 = (((((var_1_35 - var_1_34)) > (var_1_31)) ? ((var_1_35 - var_1_34)) : (var_1_31))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L76] var_1_36 = var_1_37 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=100000000000004, var_1_37=100000000000004, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L77] COND TRUE \read(last_1_var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=100000000000004, var_1_37=100000000000004, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L78] COND TRUE ((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16 [L79] var_1_11 = ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=100000000000004, var_1_37=100000000000004, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L84] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, var_1_11=0, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=100000000000004, var_1_37=100000000000004, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L85] COND TRUE (last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= stepLocal_0 [L86] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=100000000000004, var_1_37=100000000000004, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L88] signed long int stepLocal_2 = var_1_11; [L89] unsigned char stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, stepLocal_2=0, var_1_11=0, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=100000000000004, var_1_37=100000000000004, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L90] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, stepLocal_2=0, var_1_11=0, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=100000000000004, var_1_37=100000000000004, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L91] COND TRUE var_1_11 >= stepLocal_2 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, var_1_11=0, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=100000000000004, var_1_37=100000000000004, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L92] COND TRUE stepLocal_1 || (var_1_11 < var_1_11) [L93] var_1_5 = var_1_7 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=100000000000004, var_1_37=100000000000004, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=5/4] [L99] EXPR var_1_11 & var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=100000000000004, var_1_37=100000000000004, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=5/4] [L99] COND FALSE !((- var_1_11) > (var_1_11 & var_1_13)) [L110] var_1_15 = var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=-2147483647, var_1_15=5, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=100000000000004, var_1_37=100000000000004, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=5/4] [L112] COND TRUE ((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7 [L113] var_1_16 = (var_1_17 + (var_1_18 + 16.75)) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=-2147483647, var_1_15=5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=100000000000004, var_1_37=100000000000004, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=5/4] [L117] COND TRUE 10.55f < var_1_16 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=-2147483647, var_1_15=5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=100000000000004, var_1_37=100000000000004, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=5/4] [L118] COND TRUE var_1_16 > (var_1_7 * var_1_16) [L119] var_1_8 = ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000005, var_1_11=0, var_1_13=5, var_1_14=-2147483647, var_1_15=5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=100000000000004, var_1_37=100000000000004, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000005] [L198] RET step() [L199] CALL, EXPR property() [L189] EXPR ((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000005, var_1_11=0, var_1_13=5, var_1_14=-2147483647, var_1_15=5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=100000000000004, var_1_37=100000000000004, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000005] [L189-L190] return (((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13)))) && ((((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7) ? (var_1_16 == ((double) (var_1_17 + (var_1_18 + 16.75)))) : (var_1_16 == ((double) var_1_17))) ; [L199] RET, EXPR property() [L199] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000005, var_1_11=0, var_1_13=5, var_1_14=-2147483647, var_1_15=5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=100000000000004, var_1_37=100000000000004, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000005] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000005, var_1_11=0, var_1_13=5, var_1_14=-2147483647, var_1_15=5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=127, var_1_34=127, var_1_35=191, var_1_36=100000000000004, var_1_37=100000000000004, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000005] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 7, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 680 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 679 mSDsluCounter, 1926 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1010 mSDsCounter, 175 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 447 IncrementalHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 175 mSolverCounterUnsat, 916 mSDtfsCounter, 447 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 846 GetRequests, 815 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=701occurred in iteration=5, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 6 MinimizatonAttempts, 177 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1632 NumberOfCodeBlocks, 1632 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1622 ConstructedInterpolants, 0 QuantifiedInterpolants, 3360 SizeOfPredicates, 1 NumberOfNonLiveVariables, 468 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 14526/14880 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 05:14:37,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.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 fc4d323dccf5c6cb2dd33d7a9917b9da8c0abdef12ff69acd362adea0abef7c3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:14:39,554 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:14:39,632 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 05:14:39,637 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:14:39,638 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:14:39,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:14:39,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:14:39,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:14:39,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:14:39,655 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:14:39,655 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:14:39,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:14:39,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:14:39,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:14:39,655 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:14:39,655 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:14:39,655 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:14:39,655 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:14:39,656 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:14:39,656 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:14:39,656 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:14:39,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:14:39,656 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:14:39,656 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 05:14:39,656 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 05:14:39,656 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:14:39,656 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 05:14:39,657 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:14:39,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:14:39,657 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:14:39,657 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:14:39,657 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:14:39,657 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:14:39,657 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:14:39,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:14:39,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:14:39,658 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:14:39,658 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:14:39,658 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 05:14:39,658 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 05:14:39,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:14:39,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:14:39,659 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:14:39,659 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:14:39,659 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 -> fc4d323dccf5c6cb2dd33d7a9917b9da8c0abdef12ff69acd362adea0abef7c3 [2024-11-07 05:14:39,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:14:39,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:14:39,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:14:39,934 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:14:39,934 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:14:39,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i [2024-11-07 05:14:41,272 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:14:41,467 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:14:41,467 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i [2024-11-07 05:14:41,475 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9571e3f89/a73c44cf1ff845aeb098343596cdf8a2/FLAG96996e685 [2024-11-07 05:14:41,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9571e3f89/a73c44cf1ff845aeb098343596cdf8a2 [2024-11-07 05:14:41,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:14:41,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:14:41,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:14:41,494 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:14:41,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:14:41,497 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:14:41" (1/1) ... [2024-11-07 05:14:41,498 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c4ab8b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:14:41, skipping insertion in model container [2024-11-07 05:14:41,498 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:14:41" (1/1) ... [2024-11-07 05:14:41,515 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:14:41,616 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i[915,928] [2024-11-07 05:14:41,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:14:41,699 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:14:41,710 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i[915,928] [2024-11-07 05:14:41,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:14:41,760 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:14:41,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:14:41 WrapperNode [2024-11-07 05:14:41,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:14:41,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:14:41,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:14:41,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:14:41,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:14:41" (1/1) ... [2024-11-07 05:14:41,778 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:14:41" (1/1) ... [2024-11-07 05:14:41,797 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2024-11-07 05:14:41,797 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:14:41,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:14:41,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:14:41,798 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:14:41,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:14:41" (1/1) ... [2024-11-07 05:14:41,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:14:41" (1/1) ... [2024-11-07 05:14:41,807 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:14:41" (1/1) ... [2024-11-07 05:14:41,814 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 05:14:41,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:14:41" (1/1) ... [2024-11-07 05:14:41,814 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:14:41" (1/1) ... [2024-11-07 05:14:41,820 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:14:41" (1/1) ... [2024-11-07 05:14:41,826 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:14:41" (1/1) ... [2024-11-07 05:14:41,828 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:14:41" (1/1) ... [2024-11-07 05:14:41,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:14:41" (1/1) ... [2024-11-07 05:14:41,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:14:41,837 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:14:41,837 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:14:41,837 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:14:41,838 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:14:41" (1/1) ... [2024-11-07 05:14:41,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:14:41,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:14:41,864 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 05:14:41,866 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 05:14:41,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:14:41,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 05:14:41,882 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:14:41,882 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:14:41,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:14:41,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:14:41,965 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:14:41,966 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:14:58,920 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 05:14:58,920 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:14:58,927 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:14:58,928 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:14:58,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:14:58 BoogieIcfgContainer [2024-11-07 05:14:58,929 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:14:58,930 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:14:58,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:14:58,934 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:14:58,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:14:41" (1/3) ... [2024-11-07 05:14:58,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107e2ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:14:58, skipping insertion in model container [2024-11-07 05:14:58,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:14:41" (2/3) ... [2024-11-07 05:14:58,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107e2ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:14:58, skipping insertion in model container [2024-11-07 05:14:58,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:14:58" (3/3) ... [2024-11-07 05:14:58,937 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-30.i [2024-11-07 05:14:58,946 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:14:58,947 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:14:58,993 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:14:59,003 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;@29893408, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:14:59,004 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:14:59,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 58 states have internal predecessors, (79), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-07 05:14:59,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-07 05:14:59,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:14:59,019 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:14:59,020 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:14:59,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:14:59,023 INFO L85 PathProgramCache]: Analyzing trace with hash 214389263, now seen corresponding path program 1 times [2024-11-07 05:14:59,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:14:59,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [646902510] [2024-11-07 05:14:59,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:14:59,035 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 05:14:59,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:14:59,041 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 05:14:59,042 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 05:14:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:14:59,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 05:14:59,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:14:59,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 896 proven. 0 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2024-11-07 05:14:59,736 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:14:59,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:14:59,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [646902510] [2024-11-07 05:14:59,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [646902510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:14:59,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:14:59,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:14:59,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422375535] [2024-11-07 05:14:59,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:14:59,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:14:59,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:14:59,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:14:59,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:14:59,787 INFO L87 Difference]: Start difference. First operand has 91 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 58 states have internal predecessors, (79), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) 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, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-07 05:14:59,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:14:59,813 INFO L93 Difference]: Finished difference Result 175 states and 307 transitions. [2024-11-07 05:14:59,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:14:59,814 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, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 199 [2024-11-07 05:14:59,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:14:59,819 INFO L225 Difference]: With dead ends: 175 [2024-11-07 05:14:59,819 INFO L226 Difference]: Without dead ends: 87 [2024-11-07 05:14:59,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 198 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 05:14:59,822 INFO L432 NwaCegarLoop]: 134 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, 134 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 05:14:59,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:14:59,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-07 05:14:59,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-07 05:14:59,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 54 states have internal predecessors, (72), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-07 05:14:59,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 134 transitions. [2024-11-07 05:14:59,854 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 134 transitions. Word has length 199 [2024-11-07 05:14:59,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:14:59,854 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 134 transitions. [2024-11-07 05:14:59,854 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, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-07 05:14:59,855 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 134 transitions. [2024-11-07 05:14:59,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-07 05:14:59,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:14:59,857 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:14:59,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-07 05:15:00,061 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 05:15:00,062 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:15:00,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:15:00,063 INFO L85 PathProgramCache]: Analyzing trace with hash -307572511, now seen corresponding path program 1 times [2024-11-07 05:15:00,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:15:00,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414944910] [2024-11-07 05:15:00,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:15:00,068 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 05:15:00,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:15:00,070 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 05:15:00,071 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 05:15:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:00,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 05:15:00,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:15:02,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-07 05:15:02,871 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:15:02,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:15:02,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414944910] [2024-11-07 05:15:02,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [414944910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:15:02,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:15:02,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:15:02,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679888143] [2024-11-07 05:15:02,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:15:02,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 05:15:02,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:15:02,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 05:15:02,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:15:02,877 INFO L87 Difference]: Start difference. First operand 87 states and 134 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 05:15:07,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:15:10,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:15:15,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:15:15,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:15:15,017 INFO L93 Difference]: Finished difference Result 273 states and 424 transitions. [2024-11-07 05:15:15,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 05:15:15,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 199 [2024-11-07 05:15:15,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:15:15,078 INFO L225 Difference]: With dead ends: 273 [2024-11-07 05:15:15,078 INFO L226 Difference]: Without dead ends: 189 [2024-11-07 05:15:15,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:15:15,080 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 104 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 65 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2024-11-07 05:15:15,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 402 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 17 Invalid, 2 Unknown, 0 Unchecked, 12.1s Time] [2024-11-07 05:15:15,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-07 05:15:15,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 169. [2024-11-07 05:15:15,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 104 states have (on average 1.3173076923076923) internal successors, (137), 104 states have internal predecessors, (137), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-07 05:15:15,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 261 transitions. [2024-11-07 05:15:15,121 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 261 transitions. Word has length 199 [2024-11-07 05:15:15,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:15:15,122 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 261 transitions. [2024-11-07 05:15:15,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 05:15:15,124 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 261 transitions. [2024-11-07 05:15:15,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-07 05:15:15,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:15:15,128 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:15:15,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-07 05:15:15,328 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 05:15:15,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:15:15,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:15:15,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1721763832, now seen corresponding path program 1 times [2024-11-07 05:15:15,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:15:15,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557639623] [2024-11-07 05:15:15,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:15:15,332 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 05:15:15,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:15:15,336 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 05:15:15,338 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 05:15:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:16,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 05:15:16,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:15:20,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 62 proven. 174 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 05:15:20,749 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:15:22,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-07 05:15:22,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:15:22,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557639623] [2024-11-07 05:15:22,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1557639623] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:15:22,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 05:15:22,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2024-11-07 05:15:22,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125314660] [2024-11-07 05:15:22,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 05:15:22,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 05:15:22,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:15:22,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 05:15:22,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-07 05:15:22,472 INFO L87 Difference]: Start difference. First operand 169 states and 261 transitions. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 3 states have call successors, (61), 3 states have call predecessors, (61), 5 states have return successors, (62), 2 states have call predecessors, (62), 3 states have call successors, (62) [2024-11-07 05:15:28,996 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 05:15:31,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:15:31,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:15:31,321 INFO L93 Difference]: Finished difference Result 275 states and 410 transitions. [2024-11-07 05:15:31,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 05:15:31,329 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 3 states have call successors, (61), 3 states have call predecessors, (61), 5 states have return successors, (62), 2 states have call predecessors, (62), 3 states have call successors, (62) Word has length 200 [2024-11-07 05:15:31,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:15:31,331 INFO L225 Difference]: With dead ends: 275 [2024-11-07 05:15:31,331 INFO L226 Difference]: Without dead ends: 191 [2024-11-07 05:15:31,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 389 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2024-11-07 05:15:31,332 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 205 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 137 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:15:31,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 229 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 194 Invalid, 1 Unknown, 0 Unchecked, 8.2s Time] [2024-11-07 05:15:31,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-07 05:15:31,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 185. [2024-11-07 05:15:31,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 116 states have (on average 1.2672413793103448) internal successors, (147), 116 states have internal predecessors, (147), 62 states have call successors, (62), 6 states have call predecessors, (62), 6 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-07 05:15:31,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 271 transitions. [2024-11-07 05:15:31,393 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 271 transitions. Word has length 200 [2024-11-07 05:15:31,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:15:31,393 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 271 transitions. [2024-11-07 05:15:31,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 3 states have call successors, (61), 3 states have call predecessors, (61), 5 states have return successors, (62), 2 states have call predecessors, (62), 3 states have call successors, (62) [2024-11-07 05:15:31,394 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 271 transitions. [2024-11-07 05:15:31,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-07 05:15:31,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:15:31,398 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:15:31,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-07 05:15:31,605 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 05:15:31,606 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:15:31,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:15:31,607 INFO L85 PathProgramCache]: Analyzing trace with hash -2088111685, now seen corresponding path program 1 times [2024-11-07 05:15:31,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:15:31,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1574783657] [2024-11-07 05:15:31,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:15:31,608 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 05:15:31,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:15:31,610 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 05:15:31,612 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 05:15:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:32,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 05:15:32,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:15:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-07 05:15:32,517 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:15:32,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:15:32,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1574783657] [2024-11-07 05:15:32,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1574783657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:15:32,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:15:32,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:15:32,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814125455] [2024-11-07 05:15:32,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:15:32,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:15:32,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:15:32,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:15:32,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:15:32,518 INFO L87 Difference]: Start difference. First operand 185 states and 271 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 05:15:36,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:15:36,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:15:36,870 INFO L93 Difference]: Finished difference Result 367 states and 539 transitions. [2024-11-07 05:15:36,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:15:36,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 201 [2024-11-07 05:15:36,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:15:36,875 INFO L225 Difference]: With dead ends: 367 [2024-11-07 05:15:36,875 INFO L226 Difference]: Without dead ends: 185 [2024-11-07 05:15:36,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 199 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 05:15:36,876 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-07 05:15:36,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 246 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-11-07 05:15:36,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-07 05:15:36,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-07 05:15:36,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 116 states have (on average 1.25) internal successors, (145), 116 states have internal predecessors, (145), 62 states have call successors, (62), 6 states have call predecessors, (62), 6 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-07 05:15:36,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 269 transitions. [2024-11-07 05:15:36,926 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 269 transitions. Word has length 201 [2024-11-07 05:15:36,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:15:36,927 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 269 transitions. [2024-11-07 05:15:36,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 05:15:36,927 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 269 transitions. [2024-11-07 05:15:36,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-07 05:15:36,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:15:36,929 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:15:36,954 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 (5)] Ended with exit code 0 [2024-11-07 05:15:37,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 05:15:37,134 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:15:37,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:15:37,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1291736547, now seen corresponding path program 1 times [2024-11-07 05:15:37,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:15:37,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770622777] [2024-11-07 05:15:37,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:15:37,137 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 05:15:37,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:15:37,139 INFO L229 MonitoredProcess]: Starting monitored process 6 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 05:15:37,141 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 (6)] Waiting until timeout for monitored process [2024-11-07 05:15:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:15:37,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-07 05:15:37,957 INFO L278 TraceCheckSpWp]: Computing forward predicates...