./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.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', '1826fac0aaf6beb599525d92da03802aca3a315a8be49017dad700e98d033a28'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.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 1826fac0aaf6beb599525d92da03802aca3a315a8be49017dad700e98d033a28 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:18:55,648 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:18:55,775 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 06:18:55,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:18:55,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:18:55,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:18:55,816 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:18:55,816 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:18:55,817 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:18:55,817 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:18:55,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:18:55,818 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:18:55,818 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:18:55,819 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:18:55,819 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:18:55,819 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:18:55,819 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:18:55,819 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:18:55,819 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 06:18:55,819 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:18:55,819 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:18:55,819 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:18:55,819 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:18:55,820 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:18:55,820 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:18:55,820 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:18:55,820 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:18:55,820 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:18:55,820 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:18:55,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:18:55,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:18:55,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:18:55,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:18:55,820 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:18:55,820 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:18:55,820 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:18:55,820 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 06:18:55,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 06:18:55,820 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:18:55,820 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:18:55,821 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:18:55,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:18:55,821 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 -> 1826fac0aaf6beb599525d92da03802aca3a315a8be49017dad700e98d033a28 [2024-11-07 06:18:56,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:18:56,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:18:56,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:18:56,138 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:18:56,138 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:18:56,140 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i [2024-11-07 06:18:57,681 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:18:57,963 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:18:57,964 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i [2024-11-07 06:18:57,972 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a645ef26c/837b8eb81c5648989919f4c44581c460/FLAG273a44525 [2024-11-07 06:18:57,986 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a645ef26c/837b8eb81c5648989919f4c44581c460 [2024-11-07 06:18:57,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:18:57,989 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:18:57,991 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:18:57,991 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:18:57,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:18:57,995 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:18:57" (1/1) ... [2024-11-07 06:18:57,996 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31e9129a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:57, skipping insertion in model container [2024-11-07 06:18:57,996 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:18:57" (1/1) ... [2024-11-07 06:18:58,013 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:18:58,144 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i[919,932] [2024-11-07 06:18:58,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:18:58,217 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:18:58,225 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i[919,932] [2024-11-07 06:18:58,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:18:58,280 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:18:58,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:58 WrapperNode [2024-11-07 06:18:58,281 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:18:58,283 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:18:58,283 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:18:58,283 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:18:58,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:58" (1/1) ... [2024-11-07 06:18:58,297 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:58" (1/1) ... [2024-11-07 06:18:58,333 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 231 [2024-11-07 06:18:58,334 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:18:58,334 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:18:58,334 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:18:58,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:18:58,342 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:58" (1/1) ... [2024-11-07 06:18:58,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:58" (1/1) ... [2024-11-07 06:18:58,346 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:58" (1/1) ... [2024-11-07 06:18:58,361 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 06:18:58,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:58" (1/1) ... [2024-11-07 06:18:58,362 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:58" (1/1) ... [2024-11-07 06:18:58,371 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:58" (1/1) ... [2024-11-07 06:18:58,375 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:58" (1/1) ... [2024-11-07 06:18:58,378 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:58" (1/1) ... [2024-11-07 06:18:58,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:58" (1/1) ... [2024-11-07 06:18:58,383 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:18:58,384 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:18:58,384 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:18:58,384 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:18:58,385 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:58" (1/1) ... [2024-11-07 06:18:58,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:18:58,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:18:58,417 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 06:18:58,420 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 06:18:58,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:18:58,439 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:18:58,439 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:18:58,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 06:18:58,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:18:58,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:18:58,512 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:18:58,514 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:18:58,847 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-07 06:18:58,848 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:18:58,859 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:18:58,861 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:18:58,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:18:58 BoogieIcfgContainer [2024-11-07 06:18:58,861 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:18:58,864 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:18:58,865 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:18:58,872 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:18:58,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:18:57" (1/3) ... [2024-11-07 06:18:58,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6d4610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:18:58, skipping insertion in model container [2024-11-07 06:18:58,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:58" (2/3) ... [2024-11-07 06:18:58,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6d4610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:18:58, skipping insertion in model container [2024-11-07 06:18:58,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:18:58" (3/3) ... [2024-11-07 06:18:58,874 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i [2024-11-07 06:18:58,888 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:18:58,889 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:18:58,950 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:18:58,960 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;@464e86c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:18:58,961 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:18:58,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 06:18:58,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-07 06:18:58,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:18:58,984 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:58,985 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:18:58,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:18:58,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2011954659, now seen corresponding path program 1 times [2024-11-07 06:18:58,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:18:58,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82622383] [2024-11-07 06:18:58,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:18:58,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:18:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:18:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:18:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:18:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:18:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:18:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:18:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 06:18:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 06:18:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 06:18:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 06:18:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:18:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 06:18:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:18:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 06:18:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 06:18:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 06:18:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 06:18:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 06:18:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 06:18:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 06:18:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 06:18:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 06:18:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 06:18:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 06:18:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 06:18:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 06:18:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-07 06:18:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-07 06:18:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:18:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-07 06:18:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 06:18:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-07 06:18:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:18:59,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:18:59,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82622383] [2024-11-07 06:18:59,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82622383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:18:59,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:18:59,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:18:59,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520063621] [2024-11-07 06:18:59,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:18:59,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:18:59,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:18:59,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:18:59,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:18:59,479 INFO L87 Difference]: Start difference. First operand has 102 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 06:18:59,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:18:59,515 INFO L93 Difference]: Finished difference Result 197 states and 346 transitions. [2024-11-07 06:18:59,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:18:59,517 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 209 [2024-11-07 06:18:59,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:18:59,523 INFO L225 Difference]: With dead ends: 197 [2024-11-07 06:18:59,523 INFO L226 Difference]: Without dead ends: 98 [2024-11-07 06:18:59,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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 06:18:59,528 INFO L432 NwaCegarLoop]: 152 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, 152 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 06:18:59,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:18:59,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-07 06:18:59,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-07 06:18:59,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 64 states have (on average 1.375) internal successors, (88), 64 states have internal predecessors, (88), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 06:18:59,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 152 transitions. [2024-11-07 06:18:59,566 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 152 transitions. Word has length 209 [2024-11-07 06:18:59,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:18:59,567 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 152 transitions. [2024-11-07 06:18:59,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 06:18:59,567 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 152 transitions. [2024-11-07 06:18:59,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-07 06:18:59,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:18:59,571 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:59,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 06:18:59,571 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:18:59,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:18:59,572 INFO L85 PathProgramCache]: Analyzing trace with hash 503394599, now seen corresponding path program 1 times [2024-11-07 06:18:59,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:18:59,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932559615] [2024-11-07 06:18:59,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:18:59,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:18:59,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:18:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:18:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:18:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:18:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:18:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:18:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 06:18:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 06:18:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 06:18:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 06:18:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:18:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 06:18:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:18:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 06:18:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 06:18:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 06:18:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 06:18:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 06:18:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 06:18:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 06:18:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 06:18:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 06:18:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 06:18:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 06:18:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 06:18:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 06:18:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-07 06:18:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-07 06:18:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:18:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-07 06:18:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 06:18:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-07 06:18:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:59,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:18:59,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:18:59,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932559615] [2024-11-07 06:18:59,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932559615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:18:59,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:18:59,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:18:59,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354610693] [2024-11-07 06:18:59,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:18:59,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:18:59,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:18:59,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:18:59,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:18:59,933 INFO L87 Difference]: Start difference. First operand 98 states and 152 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:19:00,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:19:00,003 INFO L93 Difference]: Finished difference Result 230 states and 359 transitions. [2024-11-07 06:19:00,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:19:00,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 209 [2024-11-07 06:19:00,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:19:00,007 INFO L225 Difference]: With dead ends: 230 [2024-11-07 06:19:00,009 INFO L226 Difference]: Without dead ends: 135 [2024-11-07 06:19:00,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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 06:19:00,011 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 55 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:19:00,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 278 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:19:00,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-07 06:19:00,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 127. [2024-11-07 06:19:00,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 93 states have (on average 1.4301075268817205) internal successors, (133), 93 states have internal predecessors, (133), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 06:19:00,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 197 transitions. [2024-11-07 06:19:00,042 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 197 transitions. Word has length 209 [2024-11-07 06:19:00,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:19:00,044 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 197 transitions. [2024-11-07 06:19:00,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:19:00,044 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 197 transitions. [2024-11-07 06:19:00,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-07 06:19:00,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:19:00,047 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:19:00,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 06:19:00,048 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:19:00,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:19:00,048 INFO L85 PathProgramCache]: Analyzing trace with hash 284539881, now seen corresponding path program 1 times [2024-11-07 06:19:00,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:19:00,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497815785] [2024-11-07 06:19:00,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:19:00,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:19:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:19:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:19:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:19:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:19:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:19:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:19:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 06:19:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 06:19:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 06:19:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 06:19:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:19:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 06:19:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:19:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 06:19:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 06:19:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 06:19:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 06:19:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 06:19:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 06:19:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 06:19:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 06:19:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 06:19:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 06:19:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 06:19:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 06:19:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 06:19:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-07 06:19:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-07 06:19:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:19:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-07 06:19:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 06:19:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-07 06:19:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:00,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:19:00,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:19:00,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497815785] [2024-11-07 06:19:00,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497815785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:19:00,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:19:00,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:19:00,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562801178] [2024-11-07 06:19:00,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:19:00,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:19:00,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:19:00,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:19:00,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:19:00,529 INFO L87 Difference]: Start difference. First operand 127 states and 197 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:19:00,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:19:00,588 INFO L93 Difference]: Finished difference Result 319 states and 496 transitions. [2024-11-07 06:19:00,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:19:00,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 209 [2024-11-07 06:19:00,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:19:00,591 INFO L225 Difference]: With dead ends: 319 [2024-11-07 06:19:00,592 INFO L226 Difference]: Without dead ends: 195 [2024-11-07 06:19:00,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 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 06:19:00,593 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 76 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:19:00,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 289 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:19:00,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-07 06:19:00,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2024-11-07 06:19:00,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 146 states have (on average 1.452054794520548) internal successors, (212), 147 states have internal predecessors, (212), 43 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-07 06:19:00,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 298 transitions. [2024-11-07 06:19:00,611 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 298 transitions. Word has length 209 [2024-11-07 06:19:00,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:19:00,611 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 298 transitions. [2024-11-07 06:19:00,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:19:00,612 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 298 transitions. [2024-11-07 06:19:00,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-07 06:19:00,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:19:00,616 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:19:00,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 06:19:00,617 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:19:00,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:19:00,617 INFO L85 PathProgramCache]: Analyzing trace with hash 406873693, now seen corresponding path program 1 times [2024-11-07 06:19:00,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:19:00,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220187796] [2024-11-07 06:19:00,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:19:00,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:19:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:19:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:19:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:19:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:19:01,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:19:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:19:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 06:19:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 06:19:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 06:19:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 06:19:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:19:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 06:19:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:19:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 06:19:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 06:19:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 06:19:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 06:19:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 06:19:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 06:19:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 06:19:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 06:19:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 06:19:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 06:19:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 06:19:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 06:19:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 06:19:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-07 06:19:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-07 06:19:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:19:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-07 06:19:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 06:19:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-07 06:19:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 84 proven. 9 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 06:19:01,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:19:01,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220187796] [2024-11-07 06:19:01,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220187796] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:19:01,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243601095] [2024-11-07 06:19:01,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:19:01,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:19:01,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:19:01,522 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 06:19:01,524 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 06:19:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:01,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 06:19:01,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:19:02,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1321 proven. 66 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2024-11-07 06:19:02,377 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:19:02,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 27 proven. 66 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 06:19:02,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243601095] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:19:02,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:19:02,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2024-11-07 06:19:02,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104029677] [2024-11-07 06:19:02,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:19:02,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 06:19:02,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:19:02,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 06:19:02,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-07 06:19:02,741 INFO L87 Difference]: Start difference. First operand 192 states and 298 transitions. Second operand has 16 states, 16 states have (on average 7.875) internal successors, (126), 16 states have internal predecessors, (126), 6 states have call successors, (76), 3 states have call predecessors, (76), 5 states have return successors, (78), 6 states have call predecessors, (78), 6 states have call successors, (78) [2024-11-07 06:19:04,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:19:04,028 INFO L93 Difference]: Finished difference Result 606 states and 915 transitions. [2024-11-07 06:19:04,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-07 06:19:04,029 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.875) internal successors, (126), 16 states have internal predecessors, (126), 6 states have call successors, (76), 3 states have call predecessors, (76), 5 states have return successors, (78), 6 states have call predecessors, (78), 6 states have call successors, (78) Word has length 210 [2024-11-07 06:19:04,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:19:04,034 INFO L225 Difference]: With dead ends: 606 [2024-11-07 06:19:04,034 INFO L226 Difference]: Without dead ends: 417 [2024-11-07 06:19:04,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=391, Invalid=1091, Unknown=0, NotChecked=0, Total=1482 [2024-11-07 06:19:04,036 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 498 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 06:19:04,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 690 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 06:19:04,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-07 06:19:04,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 364. [2024-11-07 06:19:04,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 297 states have (on average 1.4478114478114479) internal successors, (430), 300 states have internal predecessors, (430), 57 states have call successors, (57), 9 states have call predecessors, (57), 9 states have return successors, (57), 54 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-07 06:19:04,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 544 transitions. [2024-11-07 06:19:04,074 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 544 transitions. Word has length 210 [2024-11-07 06:19:04,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:19:04,075 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 544 transitions. [2024-11-07 06:19:04,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.875) internal successors, (126), 16 states have internal predecessors, (126), 6 states have call successors, (76), 3 states have call predecessors, (76), 5 states have return successors, (78), 6 states have call predecessors, (78), 6 states have call successors, (78) [2024-11-07 06:19:04,076 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 544 transitions. [2024-11-07 06:19:04,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-07 06:19:04,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:19:04,079 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:19:04,100 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 06:19:04,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:19:04,280 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:19:04,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:19:04,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1329105575, now seen corresponding path program 1 times [2024-11-07 06:19:04,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:19:04,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160949401] [2024-11-07 06:19:04,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:19:04,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:19:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:19:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:19:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:19:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:19:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:19:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:19:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 06:19:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 06:19:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 06:19:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 06:19:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:19:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 06:19:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:19:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 06:19:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 06:19:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 06:19:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 06:19:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 06:19:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 06:19:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 06:19:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 06:19:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 06:19:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 06:19:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 06:19:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 06:19:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 06:19:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-07 06:19:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-07 06:19:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:19:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-07 06:19:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 06:19:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-07 06:19:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 21 proven. 72 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 06:19:04,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:19:04,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160949401] [2024-11-07 06:19:04,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160949401] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:19:04,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240035247] [2024-11-07 06:19:04,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:19:04,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:19:04,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:19:04,769 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 06:19:04,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 06:19:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:04,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 06:19:04,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:19:05,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 717 proven. 72 refuted. 0 times theorem prover too weak. 1195 trivial. 0 not checked. [2024-11-07 06:19:05,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:19:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 21 proven. 72 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 06:19:05,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240035247] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:19:05,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:19:05,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-07 06:19:05,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88358246] [2024-11-07 06:19:05,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:19:05,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 06:19:05,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:19:05,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 06:19:05,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-07 06:19:05,546 INFO L87 Difference]: Start difference. First operand 364 states and 544 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 3 states have call successors, (80), 2 states have call predecessors, (80), 4 states have return successors, (81), 3 states have call predecessors, (81), 3 states have call successors, (81) [2024-11-07 06:19:06,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:19:06,171 INFO L93 Difference]: Finished difference Result 782 states and 1138 transitions. [2024-11-07 06:19:06,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 06:19:06,172 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 3 states have call successors, (80), 2 states have call predecessors, (80), 4 states have return successors, (81), 3 states have call predecessors, (81), 3 states have call successors, (81) Word has length 210 [2024-11-07 06:19:06,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:19:06,176 INFO L225 Difference]: With dead ends: 782 [2024-11-07 06:19:06,178 INFO L226 Difference]: Without dead ends: 421 [2024-11-07 06:19:06,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2024-11-07 06:19:06,180 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 298 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 06:19:06,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 441 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 06:19:06,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-07 06:19:06,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 303. [2024-11-07 06:19:06,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 241 states have (on average 1.3817427385892116) internal successors, (333), 243 states have internal predecessors, (333), 50 states have call successors, (50), 11 states have call predecessors, (50), 11 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-07 06:19:06,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 433 transitions. [2024-11-07 06:19:06,226 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 433 transitions. Word has length 210 [2024-11-07 06:19:06,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:19:06,229 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 433 transitions. [2024-11-07 06:19:06,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 3 states have call successors, (80), 2 states have call predecessors, (80), 4 states have return successors, (81), 3 states have call predecessors, (81), 3 states have call successors, (81) [2024-11-07 06:19:06,230 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 433 transitions. [2024-11-07 06:19:06,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-07 06:19:06,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:19:06,234 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:19:06,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 06:19:06,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:19:06,436 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:19:06,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:19:06,436 INFO L85 PathProgramCache]: Analyzing trace with hash -590267408, now seen corresponding path program 1 times [2024-11-07 06:19:06,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:19:06,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313774811] [2024-11-07 06:19:06,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:19:06,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:19:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:19:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:19:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:19:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:19:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:19:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:19:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 06:19:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 06:19:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 06:19:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 06:19:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:19:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 06:19:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:19:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 06:19:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 06:19:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 06:19:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 06:19:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 06:19:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 06:19:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 06:19:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 06:19:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 06:19:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 06:19:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 06:19:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 06:19:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 06:19:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-07 06:19:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-07 06:19:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:19:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-07 06:19:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 06:19:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-07 06:19:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:06,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:19:06,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:19:06,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313774811] [2024-11-07 06:19:06,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313774811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:19:06,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:19:06,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:19:06,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079863778] [2024-11-07 06:19:06,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:19:06,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:19:06,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:19:06,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:19:06,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:19:06,782 INFO L87 Difference]: Start difference. First operand 303 states and 433 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:19:07,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:19:07,037 INFO L93 Difference]: Finished difference Result 721 states and 1024 transitions. [2024-11-07 06:19:07,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 06:19:07,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2024-11-07 06:19:07,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:19:07,041 INFO L225 Difference]: With dead ends: 721 [2024-11-07 06:19:07,042 INFO L226 Difference]: Without dead ends: 421 [2024-11-07 06:19:07,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:19:07,043 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 138 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:19:07,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 463 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:19:07,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-07 06:19:07,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 319. [2024-11-07 06:19:07,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 257 states have (on average 1.4007782101167314) internal successors, (360), 259 states have internal predecessors, (360), 50 states have call successors, (50), 11 states have call predecessors, (50), 11 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-07 06:19:07,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 460 transitions. [2024-11-07 06:19:07,077 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 460 transitions. Word has length 211 [2024-11-07 06:19:07,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:19:07,077 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 460 transitions. [2024-11-07 06:19:07,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:19:07,078 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 460 transitions. [2024-11-07 06:19:07,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-07 06:19:07,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:19:07,080 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:19:07,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 06:19:07,080 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:19:07,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:19:07,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1206639012, now seen corresponding path program 1 times [2024-11-07 06:19:07,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:19:07,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142496335] [2024-11-07 06:19:07,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:19:07,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:19:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:19:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:19:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:19:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:19:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:19:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:19:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 06:19:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 06:19:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 06:19:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 06:19:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:19:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 06:19:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:19:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 06:19:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 06:19:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 06:19:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 06:19:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 06:19:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 06:19:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 06:19:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 06:19:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 06:19:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 06:19:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 06:19:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 06:19:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 06:19:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-07 06:19:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-07 06:19:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:19:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-07 06:19:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 06:19:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-07 06:19:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:19:07,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:19:07,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142496335] [2024-11-07 06:19:07,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142496335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:19:07,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:19:07,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:19:07,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276349997] [2024-11-07 06:19:07,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:19:07,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:19:07,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:19:07,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:19:07,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:19:07,290 INFO L87 Difference]: Start difference. First operand 319 states and 460 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:19:07,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:19:07,384 INFO L93 Difference]: Finished difference Result 686 states and 987 transitions. [2024-11-07 06:19:07,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:19:07,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2024-11-07 06:19:07,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:19:07,388 INFO L225 Difference]: With dead ends: 686 [2024-11-07 06:19:07,388 INFO L226 Difference]: Without dead ends: 360 [2024-11-07 06:19:07,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 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 06:19:07,389 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 59 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:19:07,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 259 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:19:07,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-07 06:19:07,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 287. [2024-11-07 06:19:07,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 232 states have (on average 1.3836206896551724) internal successors, (321), 233 states have internal predecessors, (321), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-07 06:19:07,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 407 transitions. [2024-11-07 06:19:07,415 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 407 transitions. Word has length 211 [2024-11-07 06:19:07,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:19:07,415 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 407 transitions. [2024-11-07 06:19:07,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:19:07,416 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 407 transitions. [2024-11-07 06:19:07,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-07 06:19:07,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:19:07,418 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:19:07,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 06:19:07,418 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:19:07,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:19:07,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1873866515, now seen corresponding path program 1 times [2024-11-07 06:19:07,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:19:07,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558898419] [2024-11-07 06:19:07,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:19:07,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:19:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:19:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:19:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:19:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:19:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:19:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:19:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 06:19:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 06:19:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 06:19:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 06:19:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:19:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 06:19:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:19:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 06:19:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 06:19:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 06:19:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 06:19:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 06:19:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 06:19:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 06:19:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 06:19:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 06:19:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 06:19:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 06:19:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 06:19:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 06:19:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-07 06:19:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-07 06:19:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:19:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-07 06:19:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 06:19:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-07 06:19:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:07,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:19:07,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:19:07,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558898419] [2024-11-07 06:19:07,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558898419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:19:07,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:19:07,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:19:07,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015590879] [2024-11-07 06:19:07,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:19:07,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:19:07,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:19:07,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:19:07,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:19:07,776 INFO L87 Difference]: Start difference. First operand 287 states and 407 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:19:07,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:19:07,841 INFO L93 Difference]: Finished difference Result 572 states and 813 transitions. [2024-11-07 06:19:07,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:19:07,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2024-11-07 06:19:07,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:19:07,845 INFO L225 Difference]: With dead ends: 572 [2024-11-07 06:19:07,845 INFO L226 Difference]: Without dead ends: 288 [2024-11-07 06:19:07,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 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 06:19:07,847 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:19:07,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 271 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:19:07,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-07 06:19:07,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2024-11-07 06:19:07,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 233 states have (on average 1.3690987124463518) internal successors, (319), 234 states have internal predecessors, (319), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-07 06:19:07,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 405 transitions. [2024-11-07 06:19:07,870 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 405 transitions. Word has length 211 [2024-11-07 06:19:07,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:19:07,871 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 405 transitions. [2024-11-07 06:19:07,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:19:07,871 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 405 transitions. [2024-11-07 06:19:07,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-07 06:19:07,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:19:07,874 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:19:07,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 06:19:07,874 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:19:07,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:19:07,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1353980623, now seen corresponding path program 1 times [2024-11-07 06:19:07,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:19:07,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067720092] [2024-11-07 06:19:07,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:19:07,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:19:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:19:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:19:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:19:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:19:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:19:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:19:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 06:19:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 06:19:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 06:19:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 06:19:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:19:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 06:19:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:19:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 06:19:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 06:19:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 06:19:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 06:19:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 06:19:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 06:19:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 06:19:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 06:19:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 06:19:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 06:19:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 06:19:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 06:19:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 06:19:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-07 06:19:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-07 06:19:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:19:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-07 06:19:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 06:19:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-07 06:19:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 27 proven. 66 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 06:19:08,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:19:08,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067720092] [2024-11-07 06:19:08,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067720092] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:19:08,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729748680] [2024-11-07 06:19:08,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:19:08,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:19:08,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:19:08,253 INFO L229 MonitoredProcess]: Starting monitored process 4 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 06:19:08,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 06:19:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:08,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 06:19:08,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:19:08,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 841 proven. 66 refuted. 0 times theorem prover too weak. 1077 trivial. 0 not checked. [2024-11-07 06:19:08,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:19:08,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 27 proven. 66 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 06:19:08,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729748680] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:19:08,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:19:08,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-07 06:19:08,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514848553] [2024-11-07 06:19:08,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:19:08,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 06:19:08,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:19:08,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 06:19:08,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-07 06:19:08,977 INFO L87 Difference]: Start difference. First operand 288 states and 405 transitions. Second operand has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 3 states have call predecessors, (77), 3 states have call successors, (77) [2024-11-07 06:19:09,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:19:09,566 INFO L93 Difference]: Finished difference Result 693 states and 948 transitions. [2024-11-07 06:19:09,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 06:19:09,567 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 3 states have call predecessors, (77), 3 states have call successors, (77) Word has length 212 [2024-11-07 06:19:09,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:19:09,572 INFO L225 Difference]: With dead ends: 693 [2024-11-07 06:19:09,572 INFO L226 Difference]: Without dead ends: 408 [2024-11-07 06:19:09,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 483 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2024-11-07 06:19:09,575 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 220 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 06:19:09,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 399 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 06:19:09,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-07 06:19:09,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 288. [2024-11-07 06:19:09,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 233 states have (on average 1.3605150214592274) internal successors, (317), 234 states have internal predecessors, (317), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-07 06:19:09,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 403 transitions. [2024-11-07 06:19:09,609 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 403 transitions. Word has length 212 [2024-11-07 06:19:09,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:19:09,610 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 403 transitions. [2024-11-07 06:19:09,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 3 states have call predecessors, (77), 3 states have call successors, (77) [2024-11-07 06:19:09,610 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 403 transitions. [2024-11-07 06:19:09,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-07 06:19:09,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:19:09,613 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:19:09,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-07 06:19:09,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:19:09,814 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:19:09,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:19:09,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1280933696, now seen corresponding path program 1 times [2024-11-07 06:19:09,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:19:09,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311904058] [2024-11-07 06:19:09,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:19:09,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:19:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 06:19:09,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1490053770] [2024-11-07 06:19:09,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:19:09,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:19:09,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:19:09,921 INFO L229 MonitoredProcess]: Starting monitored process 5 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 06:19:09,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 06:19:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:19:10,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 06:19:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:19:10,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 06:19:10,359 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 06:19:10,359 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 06:19:10,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-07 06:19:10,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-07 06:19:10,567 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:19:10,727 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 06:19:10,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:19:10 BoogieIcfgContainer [2024-11-07 06:19:10,733 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 06:19:10,734 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 06:19:10,734 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 06:19:10,734 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 06:19:10,735 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:18:58" (3/4) ... [2024-11-07 06:19:10,737 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 06:19:10,738 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 06:19:10,738 INFO L158 Benchmark]: Toolchain (without parser) took 12748.86ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 117.0MB in the beginning and 112.5MB in the end (delta: 4.5MB). Peak memory consumption was 170.4MB. Max. memory is 16.1GB. [2024-11-07 06:19:10,739 INFO L158 Benchmark]: CDTParser took 0.88ms. Allocated memory is still 117.4MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:19:10,739 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.13ms. Allocated memory is still 142.6MB. Free memory was 116.9MB in the beginning and 100.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 06:19:10,739 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.10ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 96.6MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:19:10,739 INFO L158 Benchmark]: Boogie Preprocessor took 48.79ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 91.3MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 06:19:10,739 INFO L158 Benchmark]: RCFGBuilder took 477.41ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 63.7MB in the end (delta: 27.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 06:19:10,739 INFO L158 Benchmark]: TraceAbstraction took 11869.09ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 63.2MB in the beginning and 115.2MB in the end (delta: -52.0MB). Peak memory consumption was 120.0MB. Max. memory is 16.1GB. [2024-11-07 06:19:10,739 INFO L158 Benchmark]: Witness Printer took 3.53ms. Allocated memory is still 310.4MB. Free memory was 115.2MB in the beginning and 112.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:19:10,742 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.88ms. Allocated memory is still 117.4MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.13ms. Allocated memory is still 142.6MB. Free memory was 116.9MB in the beginning and 100.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.10ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 96.6MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.79ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 91.3MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 477.41ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 63.7MB in the end (delta: 27.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11869.09ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 63.2MB in the beginning and 115.2MB in the end (delta: -52.0MB). Peak memory consumption was 120.0MB. Max. memory is 16.1GB. * Witness Printer took 3.53ms. Allocated memory is still 310.4MB. Free memory was 115.2MB in the beginning and 112.5MB in the end (delta: 2.7MB). 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 190, overapproximation of shiftRight at line 115, overapproximation of someBinaryArithmeticDOUBLEoperation at line 68, overapproximation of someUnaryDOUBLEoperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 190. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 8.75; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 9.6; [L25] double var_1_4 = 7.625; [L26] double var_1_5 = 1.5; [L27] double var_1_6 = 63.17; [L28] double var_1_7 = 15.5; [L29] unsigned short int var_1_8 = 4; [L30] unsigned short int var_1_9 = 45624; [L31] unsigned short int var_1_10 = 39447; [L32] unsigned short int var_1_11 = 10; [L33] double var_1_12 = 255.5; [L34] double var_1_13 = 0.0; [L35] double var_1_14 = 127.5; [L36] float var_1_15 = 8.2; [L37] float var_1_16 = 2.8; [L38] signed short int var_1_17 = 8; [L39] double var_1_18 = 24.8; [L40] signed short int var_1_19 = -256; [L41] signed short int var_1_20 = 8; [L42] signed short int var_1_21 = 16; [L43] unsigned short int var_1_22 = 2; [L44] unsigned short int var_1_24 = 16; [L45] unsigned char var_1_25 = 0; [L46] unsigned short int var_1_26 = 1; [L47] double var_1_28 = 199.6; [L48] signed char var_1_33 = 5; [L49] signed char var_1_35 = -1; [L50] double var_1_36 = 0.6; [L51] double var_1_39 = 16.5; [L52] double var_1_40 = 0.2; [L53] float var_1_41 = 31.45; [L54] signed short int var_1_43 = -10; [L55] unsigned long int var_1_44 = 25; [L56] signed short int var_1_45 = 24450; [L57] unsigned long int var_1_46 = 8; [L58] signed short int var_1_47 = -4; [L59] unsigned short int last_1_var_1_22 = 2; VAL [isInitial=0, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_3=48/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L194] isInitial = 1 [L195] FCALL initially() [L196] COND TRUE 1 [L197] CALL updateLastVariables() [L187] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_3=48/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L197] RET updateLastVariables() [L198] CALL updateVariables() [L133] var_1_2 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_3=48/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_3=48/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L134] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_3=48/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L135] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_3=48/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_3=48/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L135] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_3=48/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L136] var_1_3 = __VERIFIER_nondet_double() [L137] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L137] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L138] var_1_4 = __VERIFIER_nondet_double() [L139] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L139] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L140] var_1_5 = __VERIFIER_nondet_double() [L141] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L141] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L142] var_1_6 = __VERIFIER_nondet_double() [L143] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L143] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L144] var_1_7 = __VERIFIER_nondet_double() [L145] 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_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=45624] [L145] 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_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=45624] [L146] var_1_9 = __VERIFIER_nondet_ushort() [L147] CALL assume_abort_if_not(var_1_9 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L147] RET assume_abort_if_not(var_1_9 >= 32767) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L148] CALL assume_abort_if_not(var_1_9 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L148] RET assume_abort_if_not(var_1_9 <= 65534) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L149] var_1_10 = __VERIFIER_nondet_ushort() [L150] CALL assume_abort_if_not(var_1_10 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L150] RET assume_abort_if_not(var_1_10 >= 32767) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L151] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L151] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L152] var_1_11 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L153] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L154] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L154] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L155] var_1_13 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L156] RET assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L157] var_1_18 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L158] RET assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L159] CALL assume_abort_if_not(var_1_18 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L159] RET assume_abort_if_not(var_1_18 != 0.0F) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L160] var_1_19 = __VERIFIER_nondet_short() [L161] CALL assume_abort_if_not(var_1_19 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L161] RET assume_abort_if_not(var_1_19 >= -32767) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L162] CALL assume_abort_if_not(var_1_19 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L162] RET assume_abort_if_not(var_1_19 <= 32766) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L163] var_1_20 = __VERIFIER_nondet_short() [L164] CALL assume_abort_if_not(var_1_20 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L164] RET assume_abort_if_not(var_1_20 >= -1) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L165] CALL assume_abort_if_not(var_1_20 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L165] RET assume_abort_if_not(var_1_20 <= 32766) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=16, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L166] var_1_21 = __VERIFIER_nondet_short() [L167] CALL assume_abort_if_not(var_1_21 >= -32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L167] RET assume_abort_if_not(var_1_21 >= -32766) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L168] CALL assume_abort_if_not(var_1_21 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L168] RET assume_abort_if_not(var_1_21 <= 32766) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=0, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L169] var_1_25 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L170] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L171] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L171] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=-1, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L172] var_1_35 = __VERIFIER_nondet_char() [L173] CALL assume_abort_if_not(var_1_35 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L173] RET assume_abort_if_not(var_1_35 >= -127) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L174] CALL assume_abort_if_not(var_1_35 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L174] RET assume_abort_if_not(var_1_35 <= 126) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_39=33/2, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L175] var_1_39 = __VERIFIER_nondet_double() [L176] CALL assume_abort_if_not((var_1_39 >= -461168.6018427382800e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 4611686.018427382800e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L176] RET assume_abort_if_not((var_1_39 >= -461168.6018427382800e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 4611686.018427382800e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_40=1/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L177] var_1_40 = __VERIFIER_nondet_double() [L178] CALL assume_abort_if_not((var_1_40 >= -461168.6018427382800e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 4611686.018427382800e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L178] RET assume_abort_if_not((var_1_40 >= -461168.6018427382800e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 4611686.018427382800e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=25, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L179] var_1_44 = __VERIFIER_nondet_ulong() [L180] CALL assume_abort_if_not(var_1_44 >= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L180] RET assume_abort_if_not(var_1_44 >= 16) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L181] CALL assume_abort_if_not(var_1_44 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L181] RET assume_abort_if_not(var_1_44 <= 32) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=24450, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L182] var_1_45 = __VERIFIER_nondet_short() [L183] CALL assume_abort_if_not(var_1_45 >= 16382) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L183] RET assume_abort_if_not(var_1_45 >= 16382) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L184] CALL assume_abort_if_not(var_1_45 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L184] RET assume_abort_if_not(var_1_45 <= 32766) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=35/4, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_8=4, var_1_9=32767] [L198] RET updateVariables() [L199] CALL step() [L63] COND TRUE \read(var_1_2) [L64] var_1_1 = (((((((((var_1_3 - var_1_4)) > (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))) ? ((var_1_3 - var_1_4)) : (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))))) < (var_1_7)) ? ((((((var_1_3 - var_1_4)) > (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))) ? ((var_1_3 - var_1_4)) : (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))))) : (var_1_7))) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=4, var_1_9=32767] [L66] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L67] COND TRUE \read(var_1_2) [L68] var_1_12 = (((((var_1_3 - (var_1_13 - 128.68))) < (var_1_7)) ? ((var_1_3 - (var_1_13 - 128.68))) : (var_1_7))) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=5, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L70] COND TRUE \read(var_1_2) [L71] var_1_33 = var_1_35 VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=8, var_1_47=-4, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L73] COND TRUE var_1_3 >= var_1_6 [L74] var_1_46 = ((((var_1_10) > (4u)) ? (var_1_10) : (4u))) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L76] var_1_14 = var_1_6 VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L77] COND FALSE !(var_1_11 > var_1_10) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=3/5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L80] COND TRUE var_1_11 != var_1_9 [L81] var_1_36 = ((((99999.5) < 0 ) ? -(99999.5) : (99999.5))) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_41=629/20, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L84] COND FALSE !(var_1_11 < (((((var_1_11) < (var_1_20)) ? (var_1_11) : (var_1_20))) / var_1_9)) [L87] var_1_41 = ((((var_1_40) < 0 ) ? -(var_1_40) : (var_1_40))) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_40=0, var_1_41=6, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L89] COND FALSE !(var_1_13 >= var_1_14) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_40=0, var_1_41=6, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L96] COND TRUE var_1_3 <= var_1_4 [L97] var_1_16 = ((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=1, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_40=0, var_1_41=6, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L99] var_1_26 = var_1_9 VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=32767, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_40=0, var_1_41=6, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L100] EXPR var_1_11 ^ 8 VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=32767, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_40=0, var_1_41=6, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L100] COND FALSE !(((var_1_11 ^ 8) * var_1_10) <= var_1_21) [L103] unsigned short int stepLocal_0 = var_1_11; VAL [isInitial=1, last_1_var_1_22=2, stepLocal_0=65536, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=8, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=32767, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_40=0, var_1_41=6, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L104] COND FALSE !(var_1_7 >= (var_1_5 / ((((var_1_13) < (var_1_18)) ? (var_1_13) : (var_1_18))))) [L113] var_1_17 = var_1_21 VAL [isInitial=1, last_1_var_1_22=2, stepLocal_0=65536, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=32767, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_40=0, var_1_41=6, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L115] EXPR ((((var_1_10) < (var_1_9)) ? (var_1_10) : (var_1_9))) >> (var_1_44 - 4u) VAL [isInitial=1, last_1_var_1_22=2, stepLocal_0=65536, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=32767, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_40=0, var_1_41=6, var_1_43=-10, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L115] COND FALSE !((((((var_1_10) < (var_1_9)) ? (var_1_10) : (var_1_9))) >> (var_1_44 - 4u)) >= var_1_9) [L118] COND TRUE ((((((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35)))) > (var_1_10)) ? (((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35)))) : (var_1_10))) > var_1_9 [L119] var_1_43 = 5 VAL [isInitial=1, last_1_var_1_22=2, stepLocal_0=65536, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=2, var_1_24=16, var_1_25=1, var_1_26=32767, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_40=0, var_1_41=6, var_1_43=5, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L122] COND TRUE (var_1_11 + var_1_20) <= ((var_1_21 * last_1_var_1_22) * var_1_19) [L123] var_1_22 = (((((var_1_9 - var_1_11)) > (var_1_10)) ? ((var_1_9 - var_1_11)) : (var_1_10))) VAL [isInitial=1, last_1_var_1_22=2, stepLocal_0=65536, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=32769, var_1_24=16, var_1_25=1, var_1_26=32767, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_40=0, var_1_41=6, var_1_43=5, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=-4, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L125] var_1_47 = var_1_45 VAL [isInitial=1, last_1_var_1_22=2, stepLocal_0=65536, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=32769, var_1_24=16, var_1_25=1, var_1_26=32767, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_40=0, var_1_41=6, var_1_43=5, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=16382, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L126] COND FALSE !(var_1_9 < var_1_11) VAL [isInitial=1, last_1_var_1_22=2, stepLocal_0=65536, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=32769, var_1_24=16, var_1_25=1, var_1_26=32767, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_40=0, var_1_41=6, var_1_43=5, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=16382, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L199] RET step() [L200] CALL, EXPR property() [L190-L191] return ((((((((var_1_2 ? (var_1_1 == ((double) (((((((((var_1_3 - var_1_4)) > (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))) ? ((var_1_3 - var_1_4)) : (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))))) < (var_1_7)) ? ((((((var_1_3 - var_1_4)) > (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))) ? ((var_1_3 - var_1_4)) : (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))))) : (var_1_7))))) : 1) && (var_1_8 == ((unsigned short int) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11)))) && (var_1_2 ? (var_1_12 == ((double) (((((var_1_3 - (var_1_13 - 128.68))) < (var_1_7)) ? ((var_1_3 - (var_1_13 - 128.68))) : (var_1_7))))) : 1)) && (var_1_14 == ((double) var_1_6))) && ((var_1_13 >= var_1_14) ? (var_1_2 ? ((var_1_8 == var_1_11) ? (var_1_15 == ((float) 10.975f)) : 1) : 1) : 1)) && ((var_1_3 <= var_1_4) ? (var_1_16 == ((float) ((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))))) : 1)) && ((var_1_7 >= (var_1_5 / ((((var_1_13) < (var_1_18)) ? (var_1_13) : (var_1_18))))) ? (((var_1_10 + var_1_9) <= var_1_11) ? (var_1_2 ? (var_1_17 == ((signed short int) var_1_19)) : 1) : (var_1_17 == ((signed short int) (var_1_20 - ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))))) : (var_1_17 == ((signed short int) var_1_21)))) && (((var_1_11 + var_1_20) <= ((var_1_21 * last_1_var_1_22) * var_1_19)) ? (var_1_22 == ((unsigned short int) (((((var_1_9 - var_1_11)) > (var_1_10)) ? ((var_1_9 - var_1_11)) : (var_1_10))))) : 1)) && ((var_1_9 < var_1_11) ? ((var_1_2 || var_1_25) ? (var_1_24 == ((unsigned short int) 128)) : 1) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=32769, var_1_24=16, var_1_25=1, var_1_26=32767, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_40=0, var_1_41=6, var_1_43=5, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=16382, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L200] RET, EXPR property() [L200] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=32769, var_1_24=16, var_1_25=1, var_1_26=32767, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_40=0, var_1_41=6, var_1_43=5, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=16382, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] [L19] reach_error() VAL [isInitial=1, last_1_var_1_22=2, var_1_10=32769, var_1_11=65536, var_1_12=3, var_1_14=4, var_1_15=41/5, var_1_16=4, var_1_17=1, var_1_19=1, var_1_1=2, var_1_20=1, var_1_21=1, var_1_22=32769, var_1_24=16, var_1_25=1, var_1_26=32767, var_1_28=998/5, var_1_2=1, var_1_33=0, var_1_35=0, var_1_36=5, var_1_40=0, var_1_41=6, var_1_43=5, var_1_44=-4294967280, var_1_45=16382, var_1_46=32769, var_1_47=16382, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=32767, var_1_9=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 10, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1374 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1344 mSDsluCounter, 3242 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1881 mSDsCounter, 395 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2179 IncrementalHoareTripleChecker+Invalid, 2574 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 395 mSolverCounterUnsat, 1361 mSDtfsCounter, 2179 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1969 GetRequests, 1877 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=364occurred in iteration=4, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 477 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 2948 NumberOfCodeBlocks, 2948 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3141 ConstructedInterpolants, 0 QuantifiedInterpolants, 6853 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1449 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 29205/29760 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 06:19:10,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.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 1826fac0aaf6beb599525d92da03802aca3a315a8be49017dad700e98d033a28 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:19:13,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:19:13,753 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 06:19:13,760 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:19:13,765 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:19:13,806 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:19:13,808 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:19:13,808 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:19:13,808 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:19:13,808 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:19:13,808 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:19:13,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:19:13,809 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:19:13,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:19:13,809 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:19:13,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:19:13,809 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:19:13,809 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:19:13,814 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:19:13,814 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:19:13,815 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:19:13,815 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:19:13,815 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:19:13,815 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 06:19:13,815 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 06:19:13,815 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:19:13,815 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 06:19:13,815 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:19:13,815 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:19:13,815 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:19:13,815 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:19:13,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:19:13,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:19:13,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:19:13,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:19:13,816 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:19:13,816 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:19:13,816 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:19:13,816 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 06:19:13,816 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 06:19:13,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:19:13,816 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:19:13,816 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:19:13,816 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:19:13,816 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 -> 1826fac0aaf6beb599525d92da03802aca3a315a8be49017dad700e98d033a28 [2024-11-07 06:19:14,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:19:14,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:19:14,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:19:14,292 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:19:14,293 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:19:14,294 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i [2024-11-07 06:19:15,932 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:19:16,166 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:19:16,167 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i [2024-11-07 06:19:16,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54947066f/5a236fd21989427d955e78cdc39ef671/FLAG5c37ee73d [2024-11-07 06:19:16,496 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54947066f/5a236fd21989427d955e78cdc39ef671 [2024-11-07 06:19:16,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:19:16,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:19:16,501 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:19:16,501 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:19:16,505 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:19:16,505 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:19:16" (1/1) ... [2024-11-07 06:19:16,506 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34c47d56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:19:16, skipping insertion in model container [2024-11-07 06:19:16,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:19:16" (1/1) ... [2024-11-07 06:19:16,527 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:19:16,658 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i[919,932] [2024-11-07 06:19:16,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:19:16,773 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:19:16,783 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i[919,932] [2024-11-07 06:19:16,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:19:16,860 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:19:16,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:19:16 WrapperNode [2024-11-07 06:19:16,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:19:16,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:19:16,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:19:16,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:19:16,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:19:16" (1/1) ... [2024-11-07 06:19:16,889 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:19:16" (1/1) ... [2024-11-07 06:19:16,929 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208 [2024-11-07 06:19:16,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:19:16,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:19:16,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:19:16,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:19:16,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:19:16" (1/1) ... [2024-11-07 06:19:16,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:19:16" (1/1) ... [2024-11-07 06:19:16,944 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:19:16" (1/1) ... [2024-11-07 06:19:16,970 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 06:19:16,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:19:16" (1/1) ... [2024-11-07 06:19:16,970 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:19:16" (1/1) ... [2024-11-07 06:19:16,988 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:19:16" (1/1) ... [2024-11-07 06:19:16,999 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:19:16" (1/1) ... [2024-11-07 06:19:17,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:19:16" (1/1) ... [2024-11-07 06:19:17,008 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:19:16" (1/1) ... [2024-11-07 06:19:17,012 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:19:17,017 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:19:17,017 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:19:17,019 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:19:17,020 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:19:16" (1/1) ... [2024-11-07 06:19:17,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:19:17,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:19:17,056 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 06:19:17,060 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 06:19:17,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:19:17,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 06:19:17,085 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:19:17,085 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:19:17,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:19:17,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:19:17,165 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:19:17,167 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:19:36,578 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-07 06:19:36,579 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:19:36,595 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:19:36,597 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:19:36,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:19:36 BoogieIcfgContainer [2024-11-07 06:19:36,598 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:19:36,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:19:36,601 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:19:36,605 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:19:36,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:19:16" (1/3) ... [2024-11-07 06:19:36,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58712826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:19:36, skipping insertion in model container [2024-11-07 06:19:36,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:19:16" (2/3) ... [2024-11-07 06:19:36,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58712826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:19:36, skipping insertion in model container [2024-11-07 06:19:36,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:19:36" (3/3) ... [2024-11-07 06:19:36,609 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-36.i [2024-11-07 06:19:36,623 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:19:36,624 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:19:36,687 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:19:36,702 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;@7f445319, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:19:36,702 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:19:36,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 62 states have internal predecessors, (86), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 06:19:36,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-07 06:19:36,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:19:36,727 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:19:36,728 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:19:36,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:19:36,734 INFO L85 PathProgramCache]: Analyzing trace with hash -340649538, now seen corresponding path program 1 times [2024-11-07 06:19:36,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:19:36,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919364720] [2024-11-07 06:19:36,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:19:36,749 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 06:19:36,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:19:36,756 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 06:19:36,757 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 06:19:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:38,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 06:19:38,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:19:38,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 942 proven. 0 refuted. 0 times theorem prover too weak. 1042 trivial. 0 not checked. [2024-11-07 06:19:38,569 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:19:38,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:19:38,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919364720] [2024-11-07 06:19:38,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [919364720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:19:38,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:19:38,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:19:38,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896259732] [2024-11-07 06:19:38,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:19:38,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:19:38,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:19:38,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:19:38,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:19:38,594 INFO L87 Difference]: Start difference. First operand has 96 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 62 states have internal predecessors, (86), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 06:19:38,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:19:38,622 INFO L93 Difference]: Finished difference Result 185 states and 326 transitions. [2024-11-07 06:19:38,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:19:38,624 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 207 [2024-11-07 06:19:38,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:19:38,630 INFO L225 Difference]: With dead ends: 185 [2024-11-07 06:19:38,630 INFO L226 Difference]: Without dead ends: 92 [2024-11-07 06:19:38,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 206 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 06:19:38,635 INFO L432 NwaCegarLoop]: 143 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, 143 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 06:19:38,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:19:38,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-07 06:19:38,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-07 06:19:38,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 58 states have internal predecessors, (79), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 06:19:38,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 143 transitions. [2024-11-07 06:19:38,672 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 143 transitions. Word has length 207 [2024-11-07 06:19:38,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:19:38,673 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 143 transitions. [2024-11-07 06:19:38,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 06:19:38,673 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 143 transitions. [2024-11-07 06:19:38,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-07 06:19:38,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:19:38,676 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:19:38,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 06:19:38,880 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 06:19:38,881 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:19:38,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:19:38,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1320989182, now seen corresponding path program 1 times [2024-11-07 06:19:38,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:19:38,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912647919] [2024-11-07 06:19:38,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:19:38,886 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 06:19:38,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:19:38,889 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 06:19:38,891 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 06:19:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:40,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 06:19:40,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:19:40,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:19:40,719 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:19:40,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:19:40,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [912647919] [2024-11-07 06:19:40,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [912647919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:19:40,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:19:40,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:19:40,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020809560] [2024-11-07 06:19:40,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:19:40,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:19:40,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:19:40,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:19:40,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:19:40,722 INFO L87 Difference]: Start difference. First operand 92 states and 143 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:19:46,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:19:51,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:19:51,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:19:51,326 INFO L93 Difference]: Finished difference Result 212 states and 332 transitions. [2024-11-07 06:19:51,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:19:51,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2024-11-07 06:19:51,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:19:51,335 INFO L225 Difference]: With dead ends: 212 [2024-11-07 06:19:51,335 INFO L226 Difference]: Without dead ends: 123 [2024-11-07 06:19:51,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:19:51,337 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 43 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2024-11-07 06:19:51,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 267 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 17 Invalid, 2 Unknown, 0 Unchecked, 10.6s Time] [2024-11-07 06:19:51,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-07 06:19:51,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2024-11-07 06:19:51,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 75 states have (on average 1.4) internal successors, (105), 75 states have internal predecessors, (105), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 06:19:51,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 169 transitions. [2024-11-07 06:19:51,371 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 169 transitions. Word has length 207 [2024-11-07 06:19:51,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:19:51,373 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 169 transitions. [2024-11-07 06:19:51,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:19:51,379 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 169 transitions. [2024-11-07 06:19:51,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-07 06:19:51,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:19:51,382 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:19:51,442 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 06:19:51,588 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 06:19:51,589 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:19:51,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:19:51,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1285034372, now seen corresponding path program 1 times [2024-11-07 06:19:51,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:19:51,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347164297] [2024-11-07 06:19:51,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:19:51,590 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 06:19:51,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:19:51,597 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 06:19:51,600 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 06:19:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:19:53,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 06:19:53,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:19:53,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 06:19:53,468 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:19:53,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:19:53,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347164297] [2024-11-07 06:19:53,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347164297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:19:53,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:19:53,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:19:53,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512877761] [2024-11-07 06:19:53,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:19:53,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:19:53,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:19:53,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:19:53,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:19:53,470 INFO L87 Difference]: Start difference. First operand 109 states and 169 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:19:59,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:20:03,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:20:03,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:20:03,591 INFO L93 Difference]: Finished difference Result 229 states and 354 transitions. [2024-11-07 06:20:03,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:20:03,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2024-11-07 06:20:03,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:20:03,756 INFO L225 Difference]: With dead ends: 229 [2024-11-07 06:20:03,756 INFO L226 Difference]: Without dead ends: 123 [2024-11-07 06:20:03,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:20:03,762 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 46 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:20:03,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 260 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 2 Unknown, 0 Unchecked, 10.1s Time] [2024-11-07 06:20:03,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-07 06:20:03,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 115. [2024-11-07 06:20:03,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 06:20:03,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 175 transitions. [2024-11-07 06:20:03,801 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 175 transitions. Word has length 207 [2024-11-07 06:20:03,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:20:03,805 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 175 transitions. [2024-11-07 06:20:03,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 06:20:03,805 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 175 transitions. [2024-11-07 06:20:03,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-07 06:20:03,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:20:03,808 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:20:03,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 06:20:04,009 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 06:20:04,009 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:20:04,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:20:04,010 INFO L85 PathProgramCache]: Analyzing trace with hash -503340732, now seen corresponding path program 1 times [2024-11-07 06:20:04,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:20:04,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615770615] [2024-11-07 06:20:04,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:20:04,011 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 06:20:04,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:20:04,016 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 06:20:04,018 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 06:20:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:20:05,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 06:20:05,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:20:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1267 proven. 180 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2024-11-07 06:20:28,420 INFO L311 TraceCheckSpWp]: Computing backward predicates...