./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-10.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', 'f2ce53af9c66d6bd4e6245b14ec3d2cb70914e6d2b607270695f04fd6258fc72'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-10.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 f2ce53af9c66d6bd4e6245b14ec3d2cb70914e6d2b607270695f04fd6258fc72 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:54:25,661 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:54:25,772 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 07:54:25,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:54:25,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:54:25,831 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:54:25,831 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:54:25,831 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:54:25,831 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:54:25,832 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:54:25,832 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:54:25,832 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:54:25,832 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:54:25,832 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:54:25,832 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:54:25,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:54:25,832 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:54:25,832 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:54:25,832 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 07:54:25,832 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:54:25,832 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:54:25,832 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:54:25,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:54:25,833 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:54:25,833 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:54:25,833 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:54:25,833 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:54:25,833 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:54:25,833 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:54:25,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:54:25,833 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:54:25,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:54:25,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:54:25,838 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:54:25,838 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:54:25,838 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:54:25,838 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 07:54:25,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 07:54:25,839 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:54:25,839 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:54:25,839 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:54:25,839 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:54:25,839 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 -> f2ce53af9c66d6bd4e6245b14ec3d2cb70914e6d2b607270695f04fd6258fc72 [2024-11-07 07:54:26,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:54:26,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:54:26,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:54:26,148 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:54:26,149 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:54:26,151 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-10.i [2024-11-07 07:54:27,356 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:54:27,605 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:54:27,606 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-10.i [2024-11-07 07:54:27,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6402bfecb/75813bf6aab045528a05e3d6dab1bbc6/FLAG1110eb2c4 [2024-11-07 07:54:27,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6402bfecb/75813bf6aab045528a05e3d6dab1bbc6 [2024-11-07 07:54:27,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:54:27,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:54:27,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:54:27,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:54:27,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:54:27,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:54:27" (1/1) ... [2024-11-07 07:54:27,957 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61a74c0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:54:27, skipping insertion in model container [2024-11-07 07:54:27,957 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:54:27" (1/1) ... [2024-11-07 07:54:27,976 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:54:28,077 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-10.i[916,929] [2024-11-07 07:54:28,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:54:28,163 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:54:28,171 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-10.i[916,929] [2024-11-07 07:54:28,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:54:28,223 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:54:28,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:54:28 WrapperNode [2024-11-07 07:54:28,224 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:54:28,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:54:28,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:54:28,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:54:28,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:54:28" (1/1) ... [2024-11-07 07:54:28,236 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:54:28" (1/1) ... [2024-11-07 07:54:28,279 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 296 [2024-11-07 07:54:28,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:54:28,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:54:28,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:54:28,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:54:28,287 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:54:28" (1/1) ... [2024-11-07 07:54:28,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:54:28" (1/1) ... [2024-11-07 07:54:28,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:54:28" (1/1) ... [2024-11-07 07:54:28,311 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 07:54:28,312 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:54:28" (1/1) ... [2024-11-07 07:54:28,312 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:54:28" (1/1) ... [2024-11-07 07:54:28,321 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:54:28" (1/1) ... [2024-11-07 07:54:28,324 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:54:28" (1/1) ... [2024-11-07 07:54:28,327 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:54:28" (1/1) ... [2024-11-07 07:54:28,328 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:54:28" (1/1) ... [2024-11-07 07:54:28,331 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:54:28,332 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:54:28,332 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:54:28,332 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:54:28,333 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:54:28" (1/1) ... [2024-11-07 07:54:28,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:54:28,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:54:28,355 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 07:54:28,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 07:54:28,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:54:28,380 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:54:28,380 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:54:28,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 07:54:28,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:54:28,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:54:28,465 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:54:28,467 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:54:28,979 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-07 07:54:28,979 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:54:28,988 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:54:28,989 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:54:28,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:54:28 BoogieIcfgContainer [2024-11-07 07:54:28,989 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:54:28,991 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:54:28,991 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:54:28,994 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:54:28,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:54:27" (1/3) ... [2024-11-07 07:54:28,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684134b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:54:28, skipping insertion in model container [2024-11-07 07:54:28,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:54:28" (2/3) ... [2024-11-07 07:54:28,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684134b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:54:28, skipping insertion in model container [2024-11-07 07:54:28,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:54:28" (3/3) ... [2024-11-07 07:54:28,996 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-10.i [2024-11-07 07:54:29,005 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:54:29,006 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:54:29,038 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:54:29,045 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;@7665980a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:54:29,045 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:54:29,048 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 94 states have (on average 1.4574468085106382) internal successors, (137), 95 states have internal predecessors, (137), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 07:54:29,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-07 07:54:29,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:54:29,059 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:54:29,059 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:54:29,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:54:29,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1121433803, now seen corresponding path program 1 times [2024-11-07 07:54:29,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:54:29,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843279507] [2024-11-07 07:54:29,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:54:29,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:54:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:54:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:54:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:54:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:54:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:54:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:54:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:54:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:54:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:54:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:54:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:54:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:54:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:54:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:54:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:54:29,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:54:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:54:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 07:54:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 07:54:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 07:54:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 07:54:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 07:54:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 07:54:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 07:54:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 07:54:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 07:54:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 07:54:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 07:54:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 07:54:29,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:54:29,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843279507] [2024-11-07 07:54:29,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843279507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:54:29,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:54:29,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:54:29,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595580908] [2024-11-07 07:54:29,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:54:29,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:54:29,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:54:29,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:54:29,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:54:29,414 INFO L87 Difference]: Start difference. First operand has 125 states, 94 states have (on average 1.4574468085106382) internal successors, (137), 95 states have internal predecessors, (137), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-07 07:54:29,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:54:29,448 INFO L93 Difference]: Finished difference Result 247 states and 411 transitions. [2024-11-07 07:54:29,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:54:29,451 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 192 [2024-11-07 07:54:29,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:54:29,456 INFO L225 Difference]: With dead ends: 247 [2024-11-07 07:54:29,456 INFO L226 Difference]: Without dead ends: 121 [2024-11-07 07:54:29,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:54:29,461 INFO L432 NwaCegarLoop]: 190 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, 190 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:54:29,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:54:29,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-07 07:54:29,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-07 07:54:29,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 91 states have internal predecessors, (130), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 07:54:29,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 186 transitions. [2024-11-07 07:54:29,505 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 186 transitions. Word has length 192 [2024-11-07 07:54:29,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:54:29,506 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 186 transitions. [2024-11-07 07:54:29,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-07 07:54:29,506 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 186 transitions. [2024-11-07 07:54:29,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-07 07:54:29,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:54:29,509 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:54:29,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 07:54:29,509 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:54:29,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:54:29,510 INFO L85 PathProgramCache]: Analyzing trace with hash -2059570613, now seen corresponding path program 1 times [2024-11-07 07:54:29,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:54:29,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280812316] [2024-11-07 07:54:29,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:54:29,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:54:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:54:29,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:54:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:54:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:54:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:54:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:54:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:54:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:54:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:54:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:54:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:54:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:54:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:54:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:54:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:54:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:54:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:54:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 07:54:29,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 07:54:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 07:54:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 07:54:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 07:54:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 07:54:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 07:54:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 07:54:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 07:54:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 07:54:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 07:54:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:29,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 07:54:29,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:54:29,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280812316] [2024-11-07 07:54:29,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280812316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:54:29,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:54:29,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:54:29,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023327361] [2024-11-07 07:54:29,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:54:29,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:54:29,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:54:29,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:54:29,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:54:29,969 INFO L87 Difference]: Start difference. First operand 121 states and 186 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 07:54:29,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:54:29,998 INFO L93 Difference]: Finished difference Result 239 states and 369 transitions. [2024-11-07 07:54:29,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:54:29,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192 [2024-11-07 07:54:29,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:54:30,000 INFO L225 Difference]: With dead ends: 239 [2024-11-07 07:54:30,000 INFO L226 Difference]: Without dead ends: 121 [2024-11-07 07:54:30,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:54:30,002 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 0 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:54:30,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 365 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:54:30,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-07 07:54:30,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-07 07:54:30,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 07:54:30,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 185 transitions. [2024-11-07 07:54:30,018 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 185 transitions. Word has length 192 [2024-11-07 07:54:30,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:54:30,020 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 185 transitions. [2024-11-07 07:54:30,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 07:54:30,020 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 185 transitions. [2024-11-07 07:54:30,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-07 07:54:30,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:54:30,022 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:54:30,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 07:54:30,023 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:54:30,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:54:30,023 INFO L85 PathProgramCache]: Analyzing trace with hash -136342579, now seen corresponding path program 1 times [2024-11-07 07:54:30,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:54:30,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986896339] [2024-11-07 07:54:30,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:54:30,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:54:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:30,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:54:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:30,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:54:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:30,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:54:30,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:30,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:54:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:30,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:54:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:30,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:54:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:30,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:54:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:30,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:54:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:30,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:54:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:30,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:54:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:30,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:54:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:30,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:54:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:30,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:54:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:30,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:54:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:30,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:54:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:30,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:54:30,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:30,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:54:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:30,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 07:54:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:30,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 07:54:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:30,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 07:54:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:30,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 07:54:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:30,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 07:54:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:30,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 07:54:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:30,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 07:54:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:30,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 07:54:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:30,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 07:54:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:30,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 07:54:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:30,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 07:54:30,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:30,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 07:54:30,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:54:30,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986896339] [2024-11-07 07:54:30,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986896339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:54:30,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:54:30,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 07:54:30,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798401934] [2024-11-07 07:54:30,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:54:30,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 07:54:30,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:54:30,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 07:54:30,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:54:30,609 INFO L87 Difference]: Start difference. First operand 121 states and 185 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 07:54:30,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:54:30,837 INFO L93 Difference]: Finished difference Result 415 states and 638 transitions. [2024-11-07 07:54:30,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 07:54:30,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192 [2024-11-07 07:54:30,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:54:30,839 INFO L225 Difference]: With dead ends: 415 [2024-11-07 07:54:30,839 INFO L226 Difference]: Without dead ends: 297 [2024-11-07 07:54:30,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:54:30,844 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 260 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:54:30,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 551 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:54:30,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-07 07:54:30,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 271. [2024-11-07 07:54:30,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 212 states have (on average 1.4433962264150944) internal successors, (306), 212 states have internal predecessors, (306), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-07 07:54:30,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 418 transitions. [2024-11-07 07:54:30,881 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 418 transitions. Word has length 192 [2024-11-07 07:54:30,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:54:30,882 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 418 transitions. [2024-11-07 07:54:30,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 07:54:30,882 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 418 transitions. [2024-11-07 07:54:30,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-07 07:54:30,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:54:30,884 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:54:30,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 07:54:30,885 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:54:30,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:54:30,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1849034032, now seen corresponding path program 1 times [2024-11-07 07:54:30,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:54:30,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773181067] [2024-11-07 07:54:30,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:54:30,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:54:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:31,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:54:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:31,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:54:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:31,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:54:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:31,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:54:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:31,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:54:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:31,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:54:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:31,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:54:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:31,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:54:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:31,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:54:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:31,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:54:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:31,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:54:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:31,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:54:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:31,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:54:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:31,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:54:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:31,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:54:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:31,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:54:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:31,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:54:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:31,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 07:54:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:31,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 07:54:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:31,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 07:54:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:31,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 07:54:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:31,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 07:54:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:31,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 07:54:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:31,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 07:54:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:31,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 07:54:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:31,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 07:54:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:31,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 07:54:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:31,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 07:54:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:31,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 07:54:31,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:54:31,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773181067] [2024-11-07 07:54:31,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773181067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:54:31,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:54:31,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 07:54:31,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300508353] [2024-11-07 07:54:31,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:54:31,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 07:54:31,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:54:31,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 07:54:31,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:54:31,503 INFO L87 Difference]: Start difference. First operand 271 states and 418 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 07:54:31,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:54:31,857 INFO L93 Difference]: Finished difference Result 893 states and 1370 transitions. [2024-11-07 07:54:31,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 07:54:31,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 194 [2024-11-07 07:54:31,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:54:31,861 INFO L225 Difference]: With dead ends: 893 [2024-11-07 07:54:31,862 INFO L226 Difference]: Without dead ends: 625 [2024-11-07 07:54:31,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:54:31,864 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 249 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:54:31,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 524 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:54:31,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2024-11-07 07:54:31,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 453. [2024-11-07 07:54:31,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 344 states have (on average 1.4127906976744187) internal successors, (486), 346 states have internal predecessors, (486), 104 states have call successors, (104), 4 states have call predecessors, (104), 4 states have return successors, (104), 102 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-07 07:54:31,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 694 transitions. [2024-11-07 07:54:31,918 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 694 transitions. Word has length 194 [2024-11-07 07:54:31,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:54:31,919 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 694 transitions. [2024-11-07 07:54:31,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 07:54:31,919 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 694 transitions. [2024-11-07 07:54:31,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-07 07:54:31,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:54:31,921 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:54:31,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 07:54:31,922 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:54:31,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:54:31,922 INFO L85 PathProgramCache]: Analyzing trace with hash 251110768, now seen corresponding path program 1 times [2024-11-07 07:54:31,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:54:31,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667862517] [2024-11-07 07:54:31,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:54:31,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:54:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:32,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:54:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:32,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:54:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:32,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:54:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:32,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:54:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:32,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:54:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:32,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:54:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:32,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:54:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:32,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:54:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:32,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:54:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:32,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:54:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:32,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:54:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:32,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:54:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:32,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:54:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:32,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:54:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:32,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:54:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:32,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:54:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:32,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:54:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:32,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 07:54:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:32,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 07:54:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:32,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 07:54:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:32,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 07:54:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:32,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 07:54:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:32,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 07:54:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:32,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 07:54:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:32,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 07:54:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:32,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 07:54:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:32,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 07:54:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:32,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 07:54:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:32,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 6 proven. 75 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-07 07:54:32,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:54:32,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667862517] [2024-11-07 07:54:32,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667862517] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:54:32,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139664338] [2024-11-07 07:54:32,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:54:32,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:54:32,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:54:32,282 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 07:54:32,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 07:54:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:32,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 07:54:32,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:54:32,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 231 proven. 75 refuted. 0 times theorem prover too weak. 1206 trivial. 0 not checked. [2024-11-07 07:54:32,734 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:54:33,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 6 proven. 75 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-07 07:54:33,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139664338] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 07:54:33,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 07:54:33,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-07 07:54:33,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674625062] [2024-11-07 07:54:33,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 07:54:33,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 07:54:33,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:54:33,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 07:54:33,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:54:33,019 INFO L87 Difference]: Start difference. First operand 453 states and 694 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 3 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) [2024-11-07 07:54:33,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:54:33,253 INFO L93 Difference]: Finished difference Result 927 states and 1405 transitions. [2024-11-07 07:54:33,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 07:54:33,254 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 3 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) Word has length 194 [2024-11-07 07:54:33,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:54:33,258 INFO L225 Difference]: With dead ends: 927 [2024-11-07 07:54:33,258 INFO L226 Difference]: Without dead ends: 477 [2024-11-07 07:54:33,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-07 07:54:33,260 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 199 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:54:33,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 381 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:54:33,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-07 07:54:33,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 469. [2024-11-07 07:54:33,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 356 states have (on average 1.3735955056179776) internal successors, (489), 358 states have internal predecessors, (489), 104 states have call successors, (104), 8 states have call predecessors, (104), 8 states have return successors, (104), 102 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-07 07:54:33,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 697 transitions. [2024-11-07 07:54:33,318 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 697 transitions. Word has length 194 [2024-11-07 07:54:33,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:54:33,319 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 697 transitions. [2024-11-07 07:54:33,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 3 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) [2024-11-07 07:54:33,319 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 697 transitions. [2024-11-07 07:54:33,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-07 07:54:33,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:54:33,321 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:54:33,340 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 07:54:33,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:54:33,525 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:54:33,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:54:33,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1762743923, now seen corresponding path program 1 times [2024-11-07 07:54:33,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:54:33,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657444586] [2024-11-07 07:54:33,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:54:33,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:54:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 07:54:33,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1415255182] [2024-11-07 07:54:33,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:54:33,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:54:33,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:54:33,645 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 07:54:33,647 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 07:54:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:33,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-07 07:54:33,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:54:37,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 1038 proven. 258 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2024-11-07 07:54:37,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:54:43,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:54:43,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657444586] [2024-11-07 07:54:43,043 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 07:54:43,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415255182] [2024-11-07 07:54:43,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415255182] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:54:43,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-07 07:54:43,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2024-11-07 07:54:43,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780737151] [2024-11-07 07:54:43,044 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-07 07:54:43,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-07 07:54:43,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:54:43,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-07 07:54:43,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=677, Unknown=0, NotChecked=0, Total=870 [2024-11-07 07:54:43,046 INFO L87 Difference]: Start difference. First operand 469 states and 697 transitions. Second operand has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 23 states have internal predecessors, (88), 8 states have call successors, (28), 8 states have call predecessors, (28), 11 states have return successors, (28), 7 states have call predecessors, (28), 8 states have call successors, (28) [2024-11-07 07:54:44,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:54:44,134 INFO L93 Difference]: Finished difference Result 1071 states and 1539 transitions. [2024-11-07 07:54:44,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-07 07:54:44,135 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 23 states have internal predecessors, (88), 8 states have call successors, (28), 8 states have call predecessors, (28), 11 states have return successors, (28), 7 states have call predecessors, (28), 8 states have call successors, (28) Word has length 195 [2024-11-07 07:54:44,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:54:44,140 INFO L225 Difference]: With dead ends: 1071 [2024-11-07 07:54:44,141 INFO L226 Difference]: Without dead ends: 605 [2024-11-07 07:54:44,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=342, Invalid=1064, Unknown=0, NotChecked=0, Total=1406 [2024-11-07 07:54:44,145 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 462 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 07:54:44,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1418 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 07:54:44,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-07 07:54:44,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 537. [2024-11-07 07:54:44,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 410 states have (on average 1.3341463414634147) internal successors, (547), 412 states have internal predecessors, (547), 104 states have call successors, (104), 22 states have call predecessors, (104), 22 states have return successors, (104), 102 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-07 07:54:44,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 755 transitions. [2024-11-07 07:54:44,190 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 755 transitions. Word has length 195 [2024-11-07 07:54:44,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:54:44,191 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 755 transitions. [2024-11-07 07:54:44,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 23 states have internal predecessors, (88), 8 states have call successors, (28), 8 states have call predecessors, (28), 11 states have return successors, (28), 7 states have call predecessors, (28), 8 states have call successors, (28) [2024-11-07 07:54:44,191 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 755 transitions. [2024-11-07 07:54:44,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-07 07:54:44,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:54:44,194 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:54:44,211 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 07:54:44,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:54:44,395 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:54:44,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:54:44,395 INFO L85 PathProgramCache]: Analyzing trace with hash -492831349, now seen corresponding path program 1 times [2024-11-07 07:54:44,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:54:44,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102062504] [2024-11-07 07:54:44,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:54:44,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:54:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 07:54:44,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1227946198] [2024-11-07 07:54:44,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:54:44,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:54:44,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:54:44,491 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 07:54:44,495 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 07:54:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:44,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-07 07:54:44,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:54:46,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 1020 proven. 162 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2024-11-07 07:54:46,445 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:54:48,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:54:48,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102062504] [2024-11-07 07:54:48,256 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 07:54:48,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227946198] [2024-11-07 07:54:48,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227946198] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:54:48,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-07 07:54:48,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2024-11-07 07:54:48,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090816432] [2024-11-07 07:54:48,257 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-07 07:54:48,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-07 07:54:48,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:54:48,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-07 07:54:48,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=852, Unknown=0, NotChecked=0, Total=1056 [2024-11-07 07:54:48,258 INFO L87 Difference]: Start difference. First operand 537 states and 755 transitions. Second operand has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 25 states have internal predecessors, (88), 7 states have call successors, (28), 7 states have call predecessors, (28), 11 states have return successors, (28), 6 states have call predecessors, (28), 7 states have call successors, (28) [2024-11-07 07:54:51,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 07:54:51,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:54:51,546 INFO L93 Difference]: Finished difference Result 1304 states and 1832 transitions. [2024-11-07 07:54:51,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-07 07:54:51,546 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 25 states have internal predecessors, (88), 7 states have call successors, (28), 7 states have call predecessors, (28), 11 states have return successors, (28), 6 states have call predecessors, (28), 7 states have call successors, (28) Word has length 195 [2024-11-07 07:54:51,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:54:51,554 INFO L225 Difference]: With dead ends: 1304 [2024-11-07 07:54:51,555 INFO L226 Difference]: Without dead ends: 1086 [2024-11-07 07:54:51,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=358, Invalid=1282, Unknown=0, NotChecked=0, Total=1640 [2024-11-07 07:54:51,557 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 407 mSDsluCounter, 1776 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:54:51,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1950 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1449 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2024-11-07 07:54:51,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2024-11-07 07:54:51,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 609. [2024-11-07 07:54:51,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 476 states have (on average 1.3571428571428572) internal successors, (646), 477 states have internal predecessors, (646), 108 states have call successors, (108), 24 states have call predecessors, (108), 24 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-07 07:54:51,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 862 transitions. [2024-11-07 07:54:51,625 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 862 transitions. Word has length 195 [2024-11-07 07:54:51,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:54:51,626 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 862 transitions. [2024-11-07 07:54:51,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 25 states have internal predecessors, (88), 7 states have call successors, (28), 7 states have call predecessors, (28), 11 states have return successors, (28), 6 states have call predecessors, (28), 7 states have call successors, (28) [2024-11-07 07:54:51,627 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 862 transitions. [2024-11-07 07:54:51,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-07 07:54:51,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:54:51,632 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:54:51,652 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 07:54:51,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:54:51,833 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:54:51,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:54:51,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1772695027, now seen corresponding path program 1 times [2024-11-07 07:54:51,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:54:51,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218682147] [2024-11-07 07:54:51,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:54:51,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:54:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:51,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:54:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:51,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:54:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:51,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:54:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:51,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:54:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:51,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:54:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:51,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:54:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:51,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:54:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:51,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:54:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:51,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:54:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:51,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:54:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:51,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:54:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:51,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:54:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:51,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:54:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:51,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:54:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:51,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:54:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:51,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:54:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:51,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:54:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:51,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 07:54:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:51,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 07:54:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:51,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 07:54:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:51,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 07:54:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:51,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 07:54:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:51,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 07:54:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:51,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 07:54:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:51,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 07:54:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:51,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 07:54:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:51,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 07:54:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:51,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 07:54:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:51,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 07:54:51,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:54:51,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218682147] [2024-11-07 07:54:51,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218682147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:54:51,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:54:51,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:54:51,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678560619] [2024-11-07 07:54:51,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:54:51,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:54:51,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:54:51,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:54:51,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:54:51,959 INFO L87 Difference]: Start difference. First operand 609 states and 862 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 07:54:52,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:54:52,037 INFO L93 Difference]: Finished difference Result 1756 states and 2484 transitions. [2024-11-07 07:54:52,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:54:52,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 195 [2024-11-07 07:54:52,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:54:52,044 INFO L225 Difference]: With dead ends: 1756 [2024-11-07 07:54:52,045 INFO L226 Difference]: Without dead ends: 1150 [2024-11-07 07:54:52,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:54:52,047 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 175 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:54:52,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 476 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:54:52,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2024-11-07 07:54:52,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 604. [2024-11-07 07:54:52,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 471 states have (on average 1.3524416135881103) internal successors, (637), 472 states have internal predecessors, (637), 108 states have call successors, (108), 24 states have call predecessors, (108), 24 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-07 07:54:52,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 853 transitions. [2024-11-07 07:54:52,099 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 853 transitions. Word has length 195 [2024-11-07 07:54:52,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:54:52,100 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 853 transitions. [2024-11-07 07:54:52,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 07:54:52,100 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 853 transitions. [2024-11-07 07:54:52,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-07 07:54:52,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:54:52,102 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:54:52,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 07:54:52,102 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:54:52,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:54:52,102 INFO L85 PathProgramCache]: Analyzing trace with hash 74152101, now seen corresponding path program 1 times [2024-11-07 07:54:52,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:54:52,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35106686] [2024-11-07 07:54:52,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:54:52,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:54:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:52,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:54:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:52,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:54:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:52,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:54:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:52,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:54:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:52,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:54:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:52,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:54:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:52,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:54:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:52,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:54:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:52,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:54:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:52,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:54:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:52,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:54:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:52,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:54:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:52,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:54:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:52,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:54:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:52,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:54:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:52,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:54:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:52,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:54:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:52,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 07:54:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:52,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 07:54:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:52,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 07:54:52,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:52,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 07:54:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:52,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 07:54:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:52,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 07:54:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:52,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 07:54:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:52,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 07:54:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:52,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 07:54:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:52,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 07:54:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:52,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 07:54:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:52,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-07 07:54:52,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:54:52,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35106686] [2024-11-07 07:54:52,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35106686] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:54:52,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288684948] [2024-11-07 07:54:52,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:54:52,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:54:52,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:54:52,432 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 07:54:52,436 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 07:54:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:54:52,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 07:54:52,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:54:52,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 277 proven. 6 refuted. 0 times theorem prover too weak. 1229 trivial. 0 not checked. [2024-11-07 07:54:52,614 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:54:52,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-07 07:54:52,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288684948] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 07:54:52,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 07:54:52,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-07 07:54:52,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103863618] [2024-11-07 07:54:52,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 07:54:52,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 07:54:52,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:54:52,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 07:54:52,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-07 07:54:52,766 INFO L87 Difference]: Start difference. First operand 604 states and 853 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-07 07:54:53,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:54:53,233 INFO L93 Difference]: Finished difference Result 1480 states and 2044 transitions. [2024-11-07 07:54:53,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 07:54:53,234 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 196 [2024-11-07 07:54:53,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:54:53,238 INFO L225 Difference]: With dead ends: 1480 [2024-11-07 07:54:53,238 INFO L226 Difference]: Without dead ends: 879 [2024-11-07 07:54:53,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 446 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=249, Unknown=0, NotChecked=0, Total=380 [2024-11-07 07:54:53,239 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 427 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 07:54:53,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 489 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 07:54:53,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2024-11-07 07:54:53,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 616. [2024-11-07 07:54:53,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 480 states have (on average 1.33125) internal successors, (639), 481 states have internal predecessors, (639), 108 states have call successors, (108), 27 states have call predecessors, (108), 27 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-07 07:54:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 855 transitions. [2024-11-07 07:54:53,301 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 855 transitions. Word has length 196 [2024-11-07 07:54:53,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:54:53,302 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 855 transitions. [2024-11-07 07:54:53,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-07 07:54:53,302 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 855 transitions. [2024-11-07 07:54:53,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-07 07:54:53,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:54:53,304 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:54:53,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 07:54:53,508 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,SelfDestructingSolverStorable8 [2024-11-07 07:54:53,509 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:54:53,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:54:53,509 INFO L85 PathProgramCache]: Analyzing trace with hash 754210471, now seen corresponding path program 1 times [2024-11-07 07:54:53,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:54:53,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630923657] [2024-11-07 07:54:53,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:54:53,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:54:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 07:54:53,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1783866711] [2024-11-07 07:54:53,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:54:53,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:54:53,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:54:53,578 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 07:54:53,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 07:54:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:54:53,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 07:54:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:54:53,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 07:54:53,829 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 07:54:53,830 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 07:54:53,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 07:54:54,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-07 07:54:54,034 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:54:54,152 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 07:54:54,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:54:54 BoogieIcfgContainer [2024-11-07 07:54:54,155 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 07:54:54,156 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 07:54:54,156 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 07:54:54,156 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 07:54:54,156 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:54:28" (3/4) ... [2024-11-07 07:54:54,158 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 07:54:54,158 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 07:54:54,159 INFO L158 Benchmark]: Toolchain (without parser) took 26208.62ms. Allocated memory was 117.4MB in the beginning and 503.3MB in the end (delta: 385.9MB). Free memory was 92.1MB in the beginning and 337.0MB in the end (delta: -244.8MB). Peak memory consumption was 140.1MB. Max. memory is 16.1GB. [2024-11-07 07:54:54,159 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 117.4MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:54:54,159 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.73ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 75.2MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 07:54:54,159 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.31ms. Allocated memory is still 117.4MB. Free memory was 75.2MB in the beginning and 69.3MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:54:54,160 INFO L158 Benchmark]: Boogie Preprocessor took 50.88ms. Allocated memory is still 117.4MB. Free memory was 69.1MB in the beginning and 60.5MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:54:54,160 INFO L158 Benchmark]: RCFGBuilder took 657.67ms. Allocated memory is still 117.4MB. Free memory was 60.3MB in the beginning and 66.5MB in the end (delta: -6.2MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2024-11-07 07:54:54,160 INFO L158 Benchmark]: TraceAbstraction took 25163.84ms. Allocated memory was 117.4MB in the beginning and 503.3MB in the end (delta: 385.9MB). Free memory was 66.0MB in the beginning and 337.1MB in the end (delta: -271.1MB). Peak memory consumption was 117.2MB. Max. memory is 16.1GB. [2024-11-07 07:54:54,160 INFO L158 Benchmark]: Witness Printer took 2.81ms. Allocated memory is still 503.3MB. Free memory was 337.1MB in the beginning and 337.0MB in the end (delta: 131.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:54:54,161 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47ms. Allocated memory is still 117.4MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.73ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 75.2MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.31ms. Allocated memory is still 117.4MB. Free memory was 75.2MB in the beginning and 69.3MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.88ms. Allocated memory is still 117.4MB. Free memory was 69.1MB in the beginning and 60.5MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 657.67ms. Allocated memory is still 117.4MB. Free memory was 60.3MB in the beginning and 66.5MB in the end (delta: -6.2MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. * TraceAbstraction took 25163.84ms. Allocated memory was 117.4MB in the beginning and 503.3MB in the end (delta: 385.9MB). Free memory was 66.0MB in the beginning and 337.1MB in the end (delta: -271.1MB). Peak memory consumption was 117.2MB. Max. memory is 16.1GB. * Witness Printer took 2.81ms. Allocated memory is still 503.3MB. Free memory was 337.1MB in the beginning and 337.0MB in the end (delta: 131.4kB). 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 200, overapproximation of bitwiseOr at line 59. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned short int var_1_7 = 10000; [L24] unsigned short int var_1_8 = 20453; [L25] signed short int var_1_10 = -5; [L26] unsigned char var_1_12 = 5; [L27] unsigned short int var_1_13 = 63501; [L28] unsigned char var_1_14 = 1; [L29] float var_1_15 = 16.25; [L30] float var_1_16 = 5.13; [L31] float var_1_17 = 99999999.25; [L32] signed char var_1_18 = 0; [L33] signed char var_1_19 = -4; [L34] signed char var_1_20 = 16; [L35] signed char var_1_21 = -100; [L36] float var_1_22 = 31.4; [L37] float var_1_23 = 16.432; [L38] float var_1_24 = 9999.5; [L39] unsigned long int var_1_26 = 100000000; [L40] unsigned short int var_1_27 = 50; [L41] float var_1_28 = 255.5; [L42] unsigned short int var_1_29 = 16; [L43] unsigned short int var_1_30 = 21823; [L44] float var_1_31 = 3.325; [L45] signed long int var_1_33 = 8; [L46] signed short int var_1_35 = -1; [L47] signed short int var_1_36 = 32549; [L48] unsigned char var_1_37 = 1; [L49] unsigned char var_1_38 = 0; [L50] unsigned char var_1_39 = 0; [L51] unsigned char var_1_40 = 128; [L52] unsigned char var_1_41 = 0; [L53] unsigned char last_1_var_1_12 = 5; [L54] unsigned long int last_1_var_1_26 = 100000000; [L55] signed short int last_1_var_1_35 = -1; VAL [isInitial=0, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=10000, var_1_8=20453] [L204] isInitial = 1 [L205] FCALL initially() [L206] int k_loop; [L207] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=10000, var_1_8=20453] [L207] COND TRUE k_loop < 1 [L208] CALL updateLastVariables() [L195] last_1_var_1_12 = var_1_12 [L196] last_1_var_1_26 = var_1_26 [L197] last_1_var_1_35 = var_1_35 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=10000, var_1_8=20453] [L208] RET updateLastVariables() [L209] CALL updateVariables() [L149] var_1_7 = __VERIFIER_nondet_ushort() [L150] CALL assume_abort_if_not(var_1_7 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=20453] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=20453] [L150] RET assume_abort_if_not(var_1_7 >= 8191) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=20453] [L151] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=20453] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=20453] [L151] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=20453] [L152] var_1_8 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L153] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L154] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L154] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L155] var_1_13 = __VERIFIER_nondet_ushort() [L156] CALL assume_abort_if_not(var_1_13 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L156] RET assume_abort_if_not(var_1_13 >= 32767) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L157] CALL assume_abort_if_not(var_1_13 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L157] RET assume_abort_if_not(var_1_13 <= 65535) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L158] var_1_14 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L159] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L160] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L160] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L161] var_1_16 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L162] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L163] var_1_17 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L164] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L165] var_1_19 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L166] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L167] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L167] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L168] var_1_20 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_20 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L169] RET assume_abort_if_not(var_1_20 >= -127) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L170] CALL assume_abort_if_not(var_1_20 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L170] RET assume_abort_if_not(var_1_20 <= 126) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L171] var_1_21 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L172] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L173] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L173] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L174] var_1_23 = __VERIFIER_nondet_float() [L175] CALL assume_abort_if_not((var_1_23 >= -461168.6018427382800e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L175] RET assume_abort_if_not((var_1_23 >= -461168.6018427382800e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L176] var_1_24 = __VERIFIER_nondet_float() [L177] CALL assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L177] RET assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L178] var_1_28 = __VERIFIER_nondet_float() [L179] CALL assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L179] RET assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L180] CALL assume_abort_if_not(var_1_28 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L180] RET assume_abort_if_not(var_1_28 != 0.0F) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L181] var_1_30 = __VERIFIER_nondet_ushort() [L182] CALL assume_abort_if_not(var_1_30 >= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L182] RET assume_abort_if_not(var_1_30 >= 16384) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L183] CALL assume_abort_if_not(var_1_30 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L183] RET assume_abort_if_not(var_1_30 <= 32767) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L184] var_1_36 = __VERIFIER_nondet_short() [L185] CALL assume_abort_if_not(var_1_36 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L185] RET assume_abort_if_not(var_1_36 >= 16383) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L186] CALL assume_abort_if_not(var_1_36 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L186] RET assume_abort_if_not(var_1_36 <= 32766) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L187] var_1_38 = __VERIFIER_nondet_uchar() [L188] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L188] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L189] CALL assume_abort_if_not(var_1_38 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L189] RET assume_abort_if_not(var_1_38 <= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L190] var_1_39 = __VERIFIER_nondet_uchar() [L191] CALL assume_abort_if_not(var_1_39 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L191] RET assume_abort_if_not(var_1_39 >= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L192] CALL assume_abort_if_not(var_1_39 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L192] RET assume_abort_if_not(var_1_39 <= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L209] RET updateVariables() [L210] CALL step() [L59] EXPR last_1_var_1_12 | last_1_var_1_35 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L59] signed long int stepLocal_5 = last_1_var_1_12 | last_1_var_1_35; [L60] COND TRUE var_1_16 >= (var_1_17 / var_1_28) [L61] var_1_27 = (last_1_var_1_26 + var_1_14) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000001, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L67] signed long int stepLocal_2 = 4 + var_1_13; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_2=32771, stepLocal_5=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000001, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L68] COND FALSE !((16 / -5) >= stepLocal_2) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000001, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L71] var_1_40 = var_1_14 [L72] var_1_10 = (var_1_40 - var_1_40) [L73] unsigned char stepLocal_1 = var_1_40; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_1=-255, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000001, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=-255, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L74] COND FALSE !(stepLocal_1 >= 4) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000001, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=-255, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L81] COND FALSE !(var_1_8 <= var_1_40) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000001, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=-255, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L84] unsigned short int stepLocal_4 = var_1_8; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_4=212991, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000001, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=-255, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L85] COND TRUE stepLocal_4 >= var_1_40 [L86] var_1_26 = var_1_7 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=-255, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L88] unsigned long int stepLocal_0 = var_1_26; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_0=8191, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=-255, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L89] COND FALSE !(stepLocal_0 <= 32) [L94] var_1_1 = ((var_1_12 + (var_1_7 - var_1_26)) + (var_1_8 - var_1_12)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=-255, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L96] COND TRUE var_1_24 < var_1_16 [L97] var_1_33 = (var_1_30 + ((var_1_1 + var_1_27) - 10)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=106741, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=-255, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L99] unsigned short int stepLocal_10 = var_1_8; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=212991, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=106741, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=-255, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L100] COND FALSE !(var_1_15 > (var_1_23 / var_1_28)) [L107] var_1_41 = var_1_38 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=212991, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=106741, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=-255, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L109] signed short int stepLocal_9 = var_1_36; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=212991, stepLocal_5=-1, stepLocal_9=16383, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=106741, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=-255, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L110] COND TRUE stepLocal_9 <= var_1_30 [L111] var_1_37 = ((! var_1_41) && var_1_38) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=212991, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=106741, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=-255, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L115] COND FALSE !(\read(var_1_37)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=212991, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=16, var_1_30=32767, var_1_31=133/40, var_1_33=106741, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=-255, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L118] COND FALSE !(\read(var_1_37)) [L121] var_1_29 = ((((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) + var_1_30) - var_1_40) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=212991, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=49149, var_1_30=32767, var_1_31=133/40, var_1_33=106741, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=-255, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L123] unsigned char stepLocal_8 = var_1_37; [L124] unsigned short int stepLocal_7 = var_1_13; [L125] signed long int stepLocal_6 = - var_1_40; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=212991, stepLocal_5=-1, stepLocal_6=-1, stepLocal_7=32767, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=49149, var_1_30=32767, var_1_31=133/40, var_1_33=106741, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=-255, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L126] COND TRUE (var_1_40 / var_1_8) <= stepLocal_7 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=212991, stepLocal_5=-1, stepLocal_6=-1, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=49149, var_1_30=32767, var_1_31=133/40, var_1_33=106741, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=-255, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L127] COND FALSE !(var_1_14 == stepLocal_6) [L132] var_1_31 = var_1_17 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=212991, stepLocal_5=-1, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=49149, var_1_30=32767, var_1_31=2, var_1_33=106741, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=-255, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L137] signed long int stepLocal_3 = (var_1_7 * var_1_12) * (var_1_29 * var_1_12); VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=212991, stepLocal_3=10064486475, stepLocal_5=-1, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=49149, var_1_30=32767, var_1_31=2, var_1_33=106741, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=-255, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L138] COND FALSE !(stepLocal_3 == (((((var_1_21) > (var_1_20)) ? (var_1_21) : (var_1_20))) + var_1_35)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=212991, stepLocal_5=-1, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000001, var_1_29=49149, var_1_30=32767, var_1_31=2, var_1_33=106741, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=-255, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L141] COND FALSE !(\read(var_1_41)) [L144] var_1_22 = var_1_24 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=212991, stepLocal_5=-1, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=3, var_1_24=3, var_1_26=8191, var_1_27=100000001, var_1_29=49149, var_1_30=32767, var_1_31=2, var_1_33=106741, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=-255, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L210] RET step() [L211] CALL, EXPR property() [L200] EXPR ((((((((var_1_26 <= 32) ? ((var_1_15 < var_1_15) ? (var_1_1 == ((unsigned short int) (var_1_26 + var_1_12))) : 1) : (var_1_1 == ((unsigned short int) ((var_1_12 + (var_1_7 - var_1_26)) + (var_1_8 - var_1_12))))) && (var_1_10 == ((signed short int) (var_1_40 - var_1_40)))) && ((var_1_40 >= 4) ? ((! ((var_1_13 - var_1_40) <= 64)) ? (var_1_12 == ((unsigned char) var_1_14)) : (var_1_12 == ((unsigned char) var_1_14))) : 1)) && ((var_1_8 <= var_1_40) ? (var_1_15 == ((float) ((((var_1_16) > (var_1_17)) ? (var_1_16) : (var_1_17))))) : 1)) && (((16 / -5) >= (4 + var_1_13)) ? (var_1_18 == ((signed char) ((((var_1_19) > (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))))) ? (var_1_19) : (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21)))))))) : 1)) && ((((var_1_7 * var_1_12) * (var_1_29 * var_1_12)) == (((((var_1_21) > (var_1_20)) ? (var_1_21) : (var_1_20))) + var_1_35)) ? (var_1_22 == ((float) (var_1_23 + var_1_24))) : (var_1_41 ? (var_1_22 == ((float) var_1_17)) : (var_1_22 == ((float) var_1_24))))) && ((var_1_8 >= var_1_40) ? (var_1_26 == ((unsigned long int) var_1_7)) : 1)) && ((var_1_16 >= (var_1_17 / var_1_28)) ? (var_1_27 == ((unsigned short int) (last_1_var_1_26 + var_1_14))) : (((last_1_var_1_12 | last_1_var_1_35) < var_1_7) ? (var_1_27 == ((unsigned short int) last_1_var_1_12)) : 1)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=3, var_1_24=3, var_1_26=8191, var_1_27=100000001, var_1_29=49149, var_1_30=32767, var_1_31=2, var_1_33=106741, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=-255, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L200] EXPR (((((((((((((((var_1_26 <= 32) ? ((var_1_15 < var_1_15) ? (var_1_1 == ((unsigned short int) (var_1_26 + var_1_12))) : 1) : (var_1_1 == ((unsigned short int) ((var_1_12 + (var_1_7 - var_1_26)) + (var_1_8 - var_1_12))))) && (var_1_10 == ((signed short int) (var_1_40 - var_1_40)))) && ((var_1_40 >= 4) ? ((! ((var_1_13 - var_1_40) <= 64)) ? (var_1_12 == ((unsigned char) var_1_14)) : (var_1_12 == ((unsigned char) var_1_14))) : 1)) && ((var_1_8 <= var_1_40) ? (var_1_15 == ((float) ((((var_1_16) > (var_1_17)) ? (var_1_16) : (var_1_17))))) : 1)) && (((16 / -5) >= (4 + var_1_13)) ? (var_1_18 == ((signed char) ((((var_1_19) > (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))))) ? (var_1_19) : (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21)))))))) : 1)) && ((((var_1_7 * var_1_12) * (var_1_29 * var_1_12)) == (((((var_1_21) > (var_1_20)) ? (var_1_21) : (var_1_20))) + var_1_35)) ? (var_1_22 == ((float) (var_1_23 + var_1_24))) : (var_1_41 ? (var_1_22 == ((float) var_1_17)) : (var_1_22 == ((float) var_1_24))))) && ((var_1_8 >= var_1_40) ? (var_1_26 == ((unsigned long int) var_1_7)) : 1)) && ((var_1_16 >= (var_1_17 / var_1_28)) ? (var_1_27 == ((unsigned short int) (last_1_var_1_26 + var_1_14))) : (((last_1_var_1_12 | last_1_var_1_35) < var_1_7) ? (var_1_27 == ((unsigned short int) last_1_var_1_12)) : 1))) && (var_1_37 ? (var_1_29 == ((unsigned short int) ((((16) > ((var_1_12 + var_1_7))) ? (16) : ((var_1_12 + var_1_7)))))) : (var_1_29 == ((unsigned short int) ((((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) + var_1_30) - var_1_40))))) && (((var_1_40 / var_1_8) <= var_1_13) ? ((var_1_14 == (- var_1_40)) ? ((var_1_37 || var_1_37) ? (var_1_31 == ((float) var_1_24)) : 1) : (var_1_31 == ((float) var_1_17))) : (var_1_31 == ((float) var_1_16)))) && ((var_1_24 < var_1_16) ? (var_1_33 == ((signed long int) (var_1_30 + ((var_1_1 + var_1_27) - 10)))) : 1)) && (var_1_37 ? (var_1_35 == ((signed short int) (var_1_12 - (var_1_36 - var_1_12)))) : 1)) && ((var_1_36 <= var_1_30) ? (var_1_37 == ((unsigned char) ((! var_1_41) && var_1_38))) : (var_1_37 == ((unsigned char) (var_1_41 || var_1_39))))) && (var_1_40 == ((unsigned char) var_1_14))) && ((var_1_15 > (var_1_23 / var_1_28)) ? (((((((var_1_33 | var_1_14)) > (var_1_36)) ? ((var_1_33 | var_1_14)) : (var_1_36))) <= var_1_8) ? (var_1_41 == ((unsigned char) 0)) : (var_1_41 == ((unsigned char) 0))) : (var_1_41 == ((unsigned char) var_1_38))) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=3, var_1_24=3, var_1_26=8191, var_1_27=100000001, var_1_29=49149, var_1_30=32767, var_1_31=2, var_1_33=106741, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=-255, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L200-L201] return (((((((((((((((var_1_26 <= 32) ? ((var_1_15 < var_1_15) ? (var_1_1 == ((unsigned short int) (var_1_26 + var_1_12))) : 1) : (var_1_1 == ((unsigned short int) ((var_1_12 + (var_1_7 - var_1_26)) + (var_1_8 - var_1_12))))) && (var_1_10 == ((signed short int) (var_1_40 - var_1_40)))) && ((var_1_40 >= 4) ? ((! ((var_1_13 - var_1_40) <= 64)) ? (var_1_12 == ((unsigned char) var_1_14)) : (var_1_12 == ((unsigned char) var_1_14))) : 1)) && ((var_1_8 <= var_1_40) ? (var_1_15 == ((float) ((((var_1_16) > (var_1_17)) ? (var_1_16) : (var_1_17))))) : 1)) && (((16 / -5) >= (4 + var_1_13)) ? (var_1_18 == ((signed char) ((((var_1_19) > (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))))) ? (var_1_19) : (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21)))))))) : 1)) && ((((var_1_7 * var_1_12) * (var_1_29 * var_1_12)) == (((((var_1_21) > (var_1_20)) ? (var_1_21) : (var_1_20))) + var_1_35)) ? (var_1_22 == ((float) (var_1_23 + var_1_24))) : (var_1_41 ? (var_1_22 == ((float) var_1_17)) : (var_1_22 == ((float) var_1_24))))) && ((var_1_8 >= var_1_40) ? (var_1_26 == ((unsigned long int) var_1_7)) : 1)) && ((var_1_16 >= (var_1_17 / var_1_28)) ? (var_1_27 == ((unsigned short int) (last_1_var_1_26 + var_1_14))) : (((last_1_var_1_12 | last_1_var_1_35) < var_1_7) ? (var_1_27 == ((unsigned short int) last_1_var_1_12)) : 1))) && (var_1_37 ? (var_1_29 == ((unsigned short int) ((((16) > ((var_1_12 + var_1_7))) ? (16) : ((var_1_12 + var_1_7)))))) : (var_1_29 == ((unsigned short int) ((((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) + var_1_30) - var_1_40))))) && (((var_1_40 / var_1_8) <= var_1_13) ? ((var_1_14 == (- var_1_40)) ? ((var_1_37 || var_1_37) ? (var_1_31 == ((float) var_1_24)) : 1) : (var_1_31 == ((float) var_1_17))) : (var_1_31 == ((float) var_1_16)))) && ((var_1_24 < var_1_16) ? (var_1_33 == ((signed long int) (var_1_30 + ((var_1_1 + var_1_27) - 10)))) : 1)) && (var_1_37 ? (var_1_35 == ((signed short int) (var_1_12 - (var_1_36 - var_1_12)))) : 1)) && ((var_1_36 <= var_1_30) ? (var_1_37 == ((unsigned char) ((! var_1_41) && var_1_38))) : (var_1_37 == ((unsigned char) (var_1_41 || var_1_39))))) && (var_1_40 == ((unsigned char) var_1_14))) && ((var_1_15 > (var_1_23 / var_1_28)) ? (((((((var_1_33 | var_1_14)) > (var_1_36)) ? ((var_1_33 | var_1_14)) : (var_1_36))) <= var_1_8) ? (var_1_41 == ((unsigned char) 0)) : (var_1_41 == ((unsigned char) 0))) : (var_1_41 == ((unsigned char) var_1_38))) ; [L211] RET, EXPR property() [L211] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=3, var_1_24=3, var_1_26=8191, var_1_27=100000001, var_1_29=49149, var_1_30=32767, var_1_31=2, var_1_33=106741, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=-255, var_1_41=0, var_1_7=-122881, var_1_8=212991] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=-255, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=16383, var_1_20=0, var_1_21=-127, var_1_22=3, var_1_24=3, var_1_26=8191, var_1_27=100000001, var_1_29=49149, var_1_30=32767, var_1_31=2, var_1_33=106741, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=-255, var_1_41=0, var_1_7=-122881, var_1_8=212991] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.0s, OverallIterations: 10, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 2183 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2179 mSDsluCounter, 6344 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4533 mSDsCounter, 429 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2874 IncrementalHoareTripleChecker+Invalid, 3304 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 429 mSolverCounterUnsat, 1811 mSDtfsCounter, 2874 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1721 GetRequests, 1609 SyntacticMatches, 2 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=616occurred in iteration=9, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 1560 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 15.9s InterpolantComputationTime, 2917 NumberOfCodeBlocks, 2917 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2512 ConstructedInterpolants, 7 QuantifiedInterpolants, 13860 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1839 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 18993/19656 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 07:54:54,210 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_loopvsstraightlinecode_100-1loop_file-10.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 f2ce53af9c66d6bd4e6245b14ec3d2cb70914e6d2b607270695f04fd6258fc72 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:54:56,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:54:56,582 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 07:54:56,591 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:54:56,591 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:54:56,622 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:54:56,622 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:54:56,622 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:54:56,623 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:54:56,623 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:54:56,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:54:56,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:54:56,623 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:54:56,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:54:56,623 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:54:56,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:54:56,623 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:54:56,623 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:54:56,623 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:54:56,623 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:54:56,623 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:54:56,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:54:56,624 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:54:56,624 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 07:54:56,624 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 07:54:56,624 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:54:56,624 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 07:54:56,624 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:54:56,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:54:56,624 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:54:56,624 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:54:56,624 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:54:56,624 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:54:56,624 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:54:56,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:54:56,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:54:56,624 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:54:56,624 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:54:56,624 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 07:54:56,624 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 07:54:56,625 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:54:56,625 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:54:56,625 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:54:56,625 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:54:56,625 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 -> f2ce53af9c66d6bd4e6245b14ec3d2cb70914e6d2b607270695f04fd6258fc72 [2024-11-07 07:54:56,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:54:56,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:54:56,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:54:56,924 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:54:56,924 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:54:56,925 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-10.i [2024-11-07 07:54:58,179 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:54:58,425 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:54:58,427 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-10.i [2024-11-07 07:54:58,437 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/28859be09/d8bdbfafdba84b1786978f8be282574f/FLAGe11e36ee1 [2024-11-07 07:54:58,770 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/28859be09/d8bdbfafdba84b1786978f8be282574f [2024-11-07 07:54:58,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:54:58,775 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:54:58,776 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:54:58,777 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:54:58,780 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:54:58,781 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:54:58" (1/1) ... [2024-11-07 07:54:58,781 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e43ffa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:54:58, skipping insertion in model container [2024-11-07 07:54:58,781 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:54:58" (1/1) ... [2024-11-07 07:54:58,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:54:58,914 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-10.i[916,929] [2024-11-07 07:54:58,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:54:58,995 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:54:59,003 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-10.i[916,929] [2024-11-07 07:54:59,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:54:59,038 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:54:59,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:54:59 WrapperNode [2024-11-07 07:54:59,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:54:59,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:54:59,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:54:59,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:54:59,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:54:59" (1/1) ... [2024-11-07 07:54:59,052 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:54:59" (1/1) ... [2024-11-07 07:54:59,079 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 209 [2024-11-07 07:54:59,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:54:59,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:54:59,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:54:59,080 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:54:59,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:54:59" (1/1) ... [2024-11-07 07:54:59,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:54:59" (1/1) ... [2024-11-07 07:54:59,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:54:59" (1/1) ... [2024-11-07 07:54:59,099 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 07:54:59,100 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:54:59" (1/1) ... [2024-11-07 07:54:59,100 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:54:59" (1/1) ... [2024-11-07 07:54:59,107 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:54:59" (1/1) ... [2024-11-07 07:54:59,110 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:54:59" (1/1) ... [2024-11-07 07:54:59,112 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:54:59" (1/1) ... [2024-11-07 07:54:59,113 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:54:59" (1/1) ... [2024-11-07 07:54:59,115 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:54:59,116 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:54:59,116 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:54:59,116 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:54:59,117 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:54:59" (1/1) ... [2024-11-07 07:54:59,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:54:59,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:54:59,159 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 07:54:59,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 07:54:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:54:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 07:54:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:54:59,185 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:54:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:54:59,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:54:59,276 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:54:59,278 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:55:05,204 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-07 07:55:05,204 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:55:05,213 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:55:05,214 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:55:05,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:55:05 BoogieIcfgContainer [2024-11-07 07:55:05,215 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:55:05,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:55:05,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:55:05,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:55:05,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:54:58" (1/3) ... [2024-11-07 07:55:05,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d801622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:55:05, skipping insertion in model container [2024-11-07 07:55:05,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:54:59" (2/3) ... [2024-11-07 07:55:05,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d801622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:55:05, skipping insertion in model container [2024-11-07 07:55:05,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:55:05" (3/3) ... [2024-11-07 07:55:05,224 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-10.i [2024-11-07 07:55:05,235 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:55:05,235 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:55:05,283 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:55:05,290 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;@5d271c5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:55:05,291 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:55:05,294 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 62 states have internal predecessors, (86), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 07:55:05,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-07 07:55:05,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:55:05,331 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:55:05,332 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:55:05,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:55:05,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1809445244, now seen corresponding path program 1 times [2024-11-07 07:55:05,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:55:05,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902992486] [2024-11-07 07:55:05,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:55:05,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:55:05,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:55:05,346 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:55:05,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 07:55:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:05,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 07:55:05,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:55:05,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2024-11-07 07:55:05,934 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:55:05,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:55:05,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902992486] [2024-11-07 07:55:05,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902992486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:55:05,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:55:05,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:55:05,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000645568] [2024-11-07 07:55:05,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:55:05,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:55:05,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:55:05,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:55:05,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:55:05,952 INFO L87 Difference]: Start difference. First operand has 92 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 62 states have internal predecessors, (86), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-07 07:55:05,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:55:05,970 INFO L93 Difference]: Finished difference Result 181 states and 309 transitions. [2024-11-07 07:55:05,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:55:05,971 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 186 [2024-11-07 07:55:05,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:55:05,976 INFO L225 Difference]: With dead ends: 181 [2024-11-07 07:55:05,976 INFO L226 Difference]: Without dead ends: 88 [2024-11-07 07:55:05,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:55:05,980 INFO L432 NwaCegarLoop]: 138 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, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:55:05,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:55:05,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-07 07:55:06,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-07 07:55:06,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 07:55:06,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 134 transitions. [2024-11-07 07:55:06,013 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 134 transitions. Word has length 186 [2024-11-07 07:55:06,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:55:06,014 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 134 transitions. [2024-11-07 07:55:06,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-07 07:55:06,014 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 134 transitions. [2024-11-07 07:55:06,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-07 07:55:06,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:55:06,016 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:55:06,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 07:55:06,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:55:06,221 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:55:06,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:55:06,222 INFO L85 PathProgramCache]: Analyzing trace with hash 498395140, now seen corresponding path program 1 times [2024-11-07 07:55:06,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:55:06,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [235937291] [2024-11-07 07:55:06,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:55:06,223 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:55:06,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:55:06,226 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:55:06,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 07:55:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:06,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 07:55:06,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:55:06,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 07:55:06,874 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:55:06,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:55:06,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [235937291] [2024-11-07 07:55:06,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [235937291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:55:06,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:55:06,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:55:06,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743656972] [2024-11-07 07:55:06,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:55:06,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:55:06,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:55:06,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:55:06,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:55:06,877 INFO L87 Difference]: Start difference. First operand 88 states and 134 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 07:55:10,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 07:55:10,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:55:10,975 INFO L93 Difference]: Finished difference Result 173 states and 265 transitions. [2024-11-07 07:55:11,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:55:11,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2024-11-07 07:55:11,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:55:11,013 INFO L225 Difference]: With dead ends: 173 [2024-11-07 07:55:11,013 INFO L226 Difference]: Without dead ends: 88 [2024-11-07 07:55:11,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:55:11,014 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:55:11,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 261 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-07 07:55:11,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-07 07:55:11,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-07 07:55:11,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 58 states have internal predecessors, (77), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 07:55:11,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 133 transitions. [2024-11-07 07:55:11,021 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 133 transitions. Word has length 186 [2024-11-07 07:55:11,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:55:11,022 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 133 transitions. [2024-11-07 07:55:11,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 07:55:11,022 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 133 transitions. [2024-11-07 07:55:11,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-07 07:55:11,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:55:11,024 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:55:11,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 07:55:11,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:55:11,225 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:55:11,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:55:11,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1307043194, now seen corresponding path program 1 times [2024-11-07 07:55:11,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:55:11,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [501360116] [2024-11-07 07:55:11,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:55:11,226 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:55:11,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:55:11,231 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:55:11,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 07:55:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:11,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 07:55:11,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:55:15,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 258 proven. 144 refuted. 0 times theorem prover too weak. 1110 trivial. 0 not checked. [2024-11-07 07:55:15,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:55:16,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:55:16,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [501360116] [2024-11-07 07:55:16,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [501360116] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:55:16,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [989090748] [2024-11-07 07:55:16,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:55:16,280 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 07:55:16,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 07:55:16,300 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 07:55:16,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-07 07:55:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:17,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 07:55:17,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:55:19,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 231 proven. 75 refuted. 0 times theorem prover too weak. 1206 trivial. 0 not checked. [2024-11-07 07:55:19,500 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:55:19,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [989090748] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:55:19,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 07:55:19,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 8 [2024-11-07 07:55:19,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438588127] [2024-11-07 07:55:19,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 07:55:19,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 07:55:19,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:55:19,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 07:55:19,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 07:55:19,656 INFO L87 Difference]: Start difference. First operand 88 states and 133 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 3 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) [2024-11-07 07:55:25,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:55:28,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:55:28,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:55:28,924 INFO L93 Difference]: Finished difference Result 183 states and 271 transitions. [2024-11-07 07:55:28,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 07:55:28,966 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 3 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) Word has length 186 [2024-11-07 07:55:28,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:55:28,968 INFO L225 Difference]: With dead ends: 183 [2024-11-07 07:55:28,968 INFO L226 Difference]: Without dead ends: 98 [2024-11-07 07:55:28,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-07 07:55:28,969 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 104 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:55:28,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 230 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 169 Invalid, 1 Unknown, 0 Unchecked, 9.0s Time] [2024-11-07 07:55:28,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-07 07:55:28,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2024-11-07 07:55:28,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 64 states have (on average 1.265625) internal successors, (81), 64 states have internal predecessors, (81), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 07:55:28,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 137 transitions. [2024-11-07 07:55:28,978 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 137 transitions. Word has length 186 [2024-11-07 07:55:28,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:55:28,979 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 137 transitions. [2024-11-07 07:55:28,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 3 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) [2024-11-07 07:55:28,979 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 137 transitions. [2024-11-07 07:55:28,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-07 07:55:28,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:55:28,981 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:55:28,998 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 07:55:29,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-07 07:55:29,388 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,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 07:55:29,389 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:55:29,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:55:29,389 INFO L85 PathProgramCache]: Analyzing trace with hash -307285023, now seen corresponding path program 1 times [2024-11-07 07:55:29,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:55:29,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1826297004] [2024-11-07 07:55:29,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:55:29,391 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:55:29,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:55:29,394 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:55:29,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 07:55:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:55:29,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 07:55:29,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:55:30,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 277 proven. 6 refuted. 0 times theorem prover too weak. 1229 trivial. 0 not checked. [2024-11-07 07:55:30,481 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:55:31,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-07 07:55:31,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:55:31,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1826297004] [2024-11-07 07:55:31,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1826297004] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 07:55:31,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 07:55:31,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-07 07:55:31,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825902204] [2024-11-07 07:55:31,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 07:55:31,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 07:55:31,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:55:31,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 07:55:31,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:55:31,871 INFO L87 Difference]: Start difference. First operand 96 states and 137 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-07 07:55:38,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:55:40,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:55:43,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:55:43,052 INFO L93 Difference]: Finished difference Result 298 states and 419 transitions. [2024-11-07 07:55:43,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 07:55:43,053 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 187 [2024-11-07 07:55:43,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:55:43,056 INFO L225 Difference]: With dead ends: 298 [2024-11-07 07:55:43,060 INFO L226 Difference]: Without dead ends: 205 [2024-11-07 07:55:43,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 366 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-07 07:55:43,065 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 323 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 157 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-11-07 07:55:43,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 477 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 361 Invalid, 1 Unknown, 0 Unchecked, 10.5s Time] [2024-11-07 07:55:43,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-07 07:55:43,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 102. [2024-11-07 07:55:43,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 69 states have internal predecessors, (86), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 07:55:43,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 142 transitions. [2024-11-07 07:55:43,106 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 142 transitions. Word has length 187 [2024-11-07 07:55:43,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:55:43,106 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 142 transitions. [2024-11-07 07:55:43,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-07 07:55:43,107 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 142 transitions. [2024-11-07 07:55:43,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-07 07:55:43,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:55:43,110 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:55:43,146 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 (6)] Ended with exit code 0 [2024-11-07 07:55:43,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:55:43,312 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:55:43,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:55:43,313 INFO L85 PathProgramCache]: Analyzing trace with hash 752545, now seen corresponding path program 1 times [2024-11-07 07:55:43,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:55:43,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712605006] [2024-11-07 07:55:43,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:55:43,313 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:55:43,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:55:43,316 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:55:43,317 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 (7)] Waiting until timeout for monitored process